Optimization of demand-related packaging sizes using a p-median approach

The determining of efficient packaging sizes is a key factor in saving material and transportation costs and also in reducing packaging waste. By analyzing the range of items and their contribution to sales-relevant order structures of a globally operating mail order company, a simplified packing algorithm is proposed. In combination with well-known methodologies, this heuristic provides near optimal solutions improving current packaging of eCommerce companies. It is shown that simple, practical heuristics are sufficient to achieve average material savings of more than 10 %. In order to find efficient packaging sizes, a set of them is generated by discretization of packaging dimensions. Given the set of orders and the set of packaging sizes, a p-median approach is applied to find a specified number of optimal, demand-related packaging sizes.     

Studying Fluid Characteristics Atop Surface Patterned Membranes via Particle Image Velocimetry

Surface patterning is a recent promising approach to promote performance of pressure-driven membranes in water treatment and desalination. Nevertheless, knowledge about foulant deposition mechanisms, especially at early stage of filtration, is still lacking. The applicability of particle imaging velocimetry to study fluid characteristics atop surface patterned thin-film composite membranes was investigated at different operating conditions. This work is an important first step toward reliable understanding of the impacts of topographical membrane surface modification on hydrodynamic conditions and foulant deposition mechanisms.     

Surface Modification of Ready-to-Use Hollow Fiber Ultrafiltration Modules for Oil/Water Separation

Reusing wastewater from oil-related industries is becoming increasingly important, especially in water-stressed oil-producing countries. Before oily wastewater can be discharged or reused, it must be properly treated, e.g., by membrane-based processes like ultrafiltration. A major issue of the applied membranes is their high fouling propensity. This paper reports on mitigating fouling inside ready-to-use ultrafiltration hollow-fiber modules used in a polishing step in oil/water separation. For this purpose, in-situ polyzwitterionic hydrogel coating was applied. The membrane performance was tested with oil nano-emulsions using a mini-plant system. The main factors influencing fouling were systematically investigated using statistical design of experiments.     

Radiation crosslinking of linear polyethyleneimine-based nanoparticles grafted to poly(glycidyl methacrylate) via trimethylolpropane triacrylate as potential electronic packaging material

Linear polyethyleneimine (L-PEI)-based nanoparticles were synthesized via hydrolysis of poly-2-methyl-2-oxazoline (PMeOx), which was prepared by cationic ring-opening polymerization of the oxazoline five-membered ring. Herein, a kinetic study of the ring-opening polymerization reaction is discussed. The nuclear magnetic resonance spectrum of PMeOx verified the presence of repeating units and terminal groups in the polymer's structure. Molar ratios of PEI and PMeOx were characterized using size exclusion chromatography with low-polydispersity polymer chains as the controlled polymerization reaction. PEI and PMeOx exhibited narrow particle size distribution with hydrodynamic radii of 89 and 67 nm, respectively, as determined via dynamic light scattering analysis. In addition, atomic forces and scanning electron microscopy were used to investigate the topography of the PEI thin films. Poly(glycidyl methacrylate) P(GMA) was grafted onto a PEI chain in the presence of trimethylolpropane triacrylate (TMPTA) as the crosslinking agent to synthesize the P(GMA–PEI–TMPTA) tripolymer via free radical polymerization using gamma irradiation. The thermal characterization of the P(GMA–PEI–TMPTA) tripolymer was conducted using thermogravimetric analysis and differential scanning calorimeter. Generally, the thermal stability of the P(GMA–PEI–TMPTA) tripolymer was improved at low-glycidyl methacrylate concentrations. The prepared tripolymer could be used as effective packaging materials for electronics industries.     

Topology-Aware Multiple Routing Configurations for Fault Tolerant Networking

Real-time services require reliable and fault tolerant communication networks to support their stringent Quality of Service requirements. Multi Topology Routing based IP Fast Re-route (MT-IPFRR) technologies provide seamless forwarding of IP packets during network failures by constructing virtual topologies (VTs) to re-route the disrupted traffic. Multiple Routing Configurations (MRC) is a widely studied MT-IPFRR technique. In this paper, we propose two heuristics, namely mMRC-1 and mMRC-2, to reduce the number of VTs required by the MRC to provide full coverage for single link/node failures, and hence, to decrease its operational complexity. Both heuristics are designed to construct more robust VTs against network partitioning by taking their topological characteristics into consideration. We perform extensive experiments on 3200 topologies with diverse structural properties using our automated topology generation and analysis tool. Numerical results show that the amount of reductions in VT requirements get higher up to 31.84 %, as the networks tend to have more hub nodes whose degree is much higher than the rest of the network.     

Accelerating SPARQL queries by exploiting hash-based locality and adaptive partitioning

State-of-the-art distributed RDF systems partition data across multiple computer nodes (workers). Some systems perform cheap hash partitioning, which may result in expensive query evaluation. Others try to minimize inter-node communication, which requires an expensive data preprocessing phase, leading to a high startup cost. Apriori knowledge of the query workload has also been used to create partitions, which, however, are static and do not adapt to workload changes. In this paper, we propose AdPart, a distributed RDF system, which addresses the shortcomings of previous work. First, AdPart applies lightweight partitioning on the initial data, which distributes triples by hashing on their subjects; this renders its startup overhead low. At the same time, the locality-aware query optimizer of AdPart takes full advantage of the partitioning to (1) support the fully parallel processing of join patterns on subjects and (2) minimize data communication for general queries by applying hash distribution of intermediate results instead of broadcasting, wherever possible. Second, AdPart monitors the data access patterns and dynamically redistributes and replicates the instances of the most frequent ones among workers. As a result, the communication cost for future queries is drastically reduced or even eliminated. To control replication, AdPart implements an eviction policy for the redistributed patterns. Our experiments with synthetic and real data verify that AdPart: (1) starts faster than all existing systems; (2) processes thousands of queries before other systems become online; and (3) gracefully adapts to the query load, being able to evaluate queries on billion-scale RDF data in subseconds.     

Are U.K. Citizens Satisfied With E-Government Services? Identifying and Testing Antecedents of Satisfaction

Citizens’ satisfaction is acknowledged as one of the most significant influences for e-government adoption and diffusion. This study examines the impact of information quality, system quality, trust, and cost on user satisfaction of e-government services. Using a survey, this study collected 1518 valid responses from e-government service adopters across the United Kingdom. Our empirical outcomes show the five factors identified in this study have a significant impact on U.K. citizens’ satisfaction with e-government services.     

A large vocabulary system for Arabic online handwriting recognition

The success of using Hidden Markov Models (HMMs) for speech recognition application has motivated the adoption of these models for handwriting recognition especially the online handwriting that has large similarity with the speech signal as a sequential process. Some languages such as Arabic, Farsi and Urdo include large number of delayed strokes that are written above or below most letters and usually written delayed in time. These delayed strokes represent a modeling challenge for the conventional left-right HMM that is commonly used for Automatic Speech Recognition (ASR) systems. In this paper, we introduce a new approach for handling delayed strokes in Arabic online handwriting recognition using HMMs. We also show that several modeling approaches such as context based tri-grapheme models, speaker adaptive training and discriminative training that are currently used in most state-of-the-art ASR systems can provide similar performance improvement for Hand Writing Recognition (HWR) systems. Finally, we show that using a multi-pass decoder that use the computationally less expensive models in the early passes can provide an Arabic large vocabulary HWR system with practical decoding time. We evaluated the performance of our proposed Arabic HWR system using two databases of small and large lexicons. For the small lexicon data set, our system achieved competing results compared to the best reported state-of-the-art Arabic HWR systems. For the large lexicon, our system achieved promising results (accuracy and time) for a vocabulary size of 64k words with the possibility of adapting the models for specific writers to get even better results.     

Term frequency with average term occurrences for textual information retrieval

In the context of information retrieval (IR) from text documents, the term weighting scheme (TWS) is a key component of the matching mechanism when using the vector space model. In this paper, we propose a new TWS that is based on computing the average term occurrences of terms in documents and it also uses a discriminative approach based on the document centroid vector to remove less significant weights from the documents. We call our approach Term Frequency With Average Term Occurrence (TF-ATO). An analysis of commonly used document collections shows that test collections are not fully judged as achieving that is expensive and maybe infeasible for large collections. A document collection being fully judged means that every document in the collection acts as a relevant document to a specific query or a group of queries. The discriminative approach used in our proposed approach is a heuristic method for improving the IR effectiveness and performance and it has the advantage of not requiring previous knowledge about relevance judgements. We compare the performance of the proposed TF-ATO to the well-known TF-IDF approach and show that using TF-ATO results in better effectiveness in both static and dynamic document collections. In addition, this paper investigates the impact that stop-words removal and our discriminative approach have on TF-IDF and TF-ATO. The results show that both, stop-words removal and the discriminative approach, have a positive effect on both term-weighting schemes. More importantly, it is shown that using the proposed discriminative approach is beneficial for improving IR effectiveness and performance with no information on the relevance judgement for the collection.     

Studying re-opened bugs in open source software

Bug fixing accounts for a large amount of the software maintenance resources. Generally, bugs are reported, fixed, verified and closed. However, in some cases bugs have to be re-opened. Re-opened bugs increase maintenance costs, degrade the overall user-perceived quality of the software and lead to unnecessary rework by busy practitioners. In this paper, we study and predict re-opened bugs through a case study on three large open source projects—namely Eclipse, Apache and OpenOffice. We structure our study along four dimensions: (1) the work habits dimension (e.g., the weekday on which the bug was initially closed), (2) the bug report dimension (e.g., the component in which the bug was found) (3) the bug fix dimension (e.g., the amount of time it took to perform the initial fix) and (4) the team dimension (e.g., the experience of the bug fixer). We build decision trees using the aforementioned factors that aim to predict re-opened bugs. We perform top node analysis to determine which factors are the most important indicators of whether or not a bug will be re-opened. Our study shows that the comment text and last status of the bug when it is initially closed are the most important factors related to whether or not a bug will be re-opened. Using a combination of these dimensions, we can build explainable prediction models that can achieve a precision between 52.1–78.6 % and a recall in the range of 70.5–94.1 % when predicting whether a bug will be re-opened. We find that the factors that best indicate which bugs might be re-opened vary based on the project. The comment text is the most important factor for the Eclipse and OpenOffice projects, while the last status is the most important one for Apache. These factors should be closely examined in order to reduce maintenance cost due to re-opened bugs.