ppxscal/embedding_network huggingface dataset:
Adobe Photoshop Lightroom 2: A Digital Photographer's Guide
Authors: David Huss, David Plotkin
Venue:  (2008)

Adobe Photoshop Lightroom has taken the photography world by storm! Let two industry experts, Dave Huss and David Plotkin, help you get up to speed fast with the all-new version 2. This complete reference for all users of Lightroom starts out with the basics, covering each available tool found in Lightroom with step-by-step clarity. The book then moves on to more in-depth discussions of the most often used tools and techniques, so you can customize a workflow that best suits your own needs. Start at the beginning to develop a complete set of Lightroom skills, or skip ahead to the sections that delve deeper into the tools you want to use immediately. Learn how to work smarter, faster, and more creatively to improve the overall quality of your work so you can spend less time in front of the computer and more time behind your camera! *Maximize your productivity and learn from two experts exactly how to incorporate Adobe Photoshop Lightroom into your own workflow, whether you use Windows or a Mac *Fully up-to-date with the latest features of Lightroom 2 and packed with full color, step-by-step screenshots and photographs *Visit www.focalpress.com/Lightroom for additional Lightroom tutorials, software news and updates
Some Investigations Concerning the CTMC and the ODE Model Derived From Bio-PEPA
Authors: Federica Ciocchetta, Andrea Degasperi, Jane Hillston, Muffy Calder
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Bio-PEPA is a recently defined language for the modelling and analysis of biochemical networks. It supports an abstract style of modelling, in which discrete levels of concentration within a species are considered instead of individual molecules. A finer granularity for the system corresponds to a smaller concentration step size and therefore to a greater number of concentration levels. This style of model is amenable to a variety of different analysis techniques, including numerical analysis based on a CMTC with states reflecting the levels of concentration. In this paper we present a formal definition of the CTMC with levels derived from a Bio-PEPA system. Furthermore we investigate the relationship between this CTMC and the system of ordinary differential equations (ODEs) derived from the same model. Using Kurtz's theorem, we show that the set of ODEs derived from the Bio-PEPA model is able to capture the limiting behaviour of the CTMC obtained from the same system. Finally, we define an empirical methodology to find the granularity of the Bio-PEPA system for which the ODE and the CTMC with levels are in a good agreement. The proposed definition is based on a notion of distance between the two models. We demonstrate our approach on a model of the Repressilator, a simple biochemical network with oscillating behaviour.
Context-aware systems: A literature review and classification
Authors: Jong-yi Hong, Eui-ho Suh, Sung-Jin Kim
Venue: Expert Systems with Applications: An International Journal (2009)

Nowadays, numerous journals and conferences have published articles related to context-aware systems, indicating many researchers' interest. Therefore, the goal of this paper is to review the works that were published in journals, suggest a new classification framework of context-aware systems, and explore each feature of classification framework. This paper is based on a literature review of context-aware systems from 2000 to 2007 using a keyword index and article title search. The classification framework is developed based on the architecture of context-aware systems, which consists of the following five layers: concept and research layer, network layer, middleware layer, application layer and user infrastructure layer. The articles are categorized based on the classification framework. This paper allows researchers to extract several lessons learned that are important for the implementation of context-aware systems.
Distance-regular graphs and the q-tetrahedron algebra
Authors: Tatsuro Ito, Paul Terwilliger
Venue: European Journal of Combinatorics (2009)

Let @C denote a distance-regular graph with classical parameters (D,b,@a,@b) and b
Cultural differences in conceptual models of ride comfort for high-speed trains
Authors: Joo Hwan Lee, Beom Suk Jin, Yong Gu Ji, Myung Hwan Yun
Venue: Human Factors in Ergonomics Manufacturing (2009)

This study focuses on an analysis of the difference in cultural experiences for similar services through analyzing the difference in conceptual models of ride comfort for passengers of KTX (Korea Train eXpress) and TGV (Train a Grand Vitesse). These trains operate with identical platforms; KTX was introduced by K-TGV (Korea-TGV) based on TGV (French high-speed train). For the conceptual models of ride comfort, this study surveyed 200 KTX passengers on the Seoul--Busan line (duration: 2 hours 30 minutes) and surveyed 150 France TGV passengers on the Paris--Marseilles line (duration: 2 hours 40 minutes). The conceptual models of ride comfort were analyzed using structural equation modeling (SEM). In the results of the study, though there were differences in cultural environment (e.g., physical environment, body size, etc.) and cultural mentality (e.g., preference, unconscious rule, etc.), the models of ride comfort for both countries shared similar critical factors. However, there were significant differences in loading values of ride comfort for these critical factors. In particular, there were differences of 1.5 to 2 times between the two models regarding the subfactors seat factor and human fatigue factor. In conclusion, this study elicits that experience factor is the most influential on ride comfort, and cultural factors are applied as essential variables in ride comfort improvement. &copy; 2009 Wiley Periodicals, Inc.
Comparison of animation storyboard education in China and the United States
Authors: Hui Zhu, Frank Suarez, Xiaobo Lu
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

This paper will compare and explore approaches to animation storyboard education between China and the United States. The intent of this paper is to boost the quality of animation storyboard education and give insight into how to most effectively teach animation storyboarding within the context of the current state of the animation industry in China and to promote an identity based on Chinese cultural thought. A good storyboard for China's original animation production is not only a process stage, it is the hope of the whole China's animation industry.
Improved approximation algorithms for the single-sink buy-at-bulk network design problems
Authors: Raja Jothi, Balaji Raghavachari
Venue: Journal of Discrete Algorithms (2009)

Consider a given undirected graph G=(V,E) with non-negative edge lengths, a root node r@?V, and a set D@?V of demands with d"v representing the units of flow that demand v@?D wishes to send to the root. We are also given K types of cables, each with a specified capacity and cost per unit length. The single-sink buy-at-bulk (SSBB) problem asks for a low-cost installation of cables along the edges of G, such that the demands can simultaneously send their flow to root r. The problem is studied with and without the restriction that the flow from a node must follow a single path to the root. We are allowed to install zero or more copies of a cable type on each edge. The SSBB problem is NP-hard. In this paper, we present a 153.6-approximation algorithm for the SSBB problem improving the previous best ratio of 216. For the case in which the flow is splittable, we improve the previous best ratio of 76.8 to @a"K, where @a"K is less than 67.94 for all K. In particular, @a"2
Modeling and Simulation of UAV Trajectory Planning on GAs
Authors: Zhiqiu Chen, Yun Liu, Jianjun Luo, Hong Jiang
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

According to the design requirement of UAV (The unmanned aircraft vehicle), the models of threat, UAV's dynamics, guidance and trajectory planning are established. Trajectory planning adopts genetic algorithms (GAs) and genetic coding uses "distance, corner" program. Through simulating by Matlab/Simlink software, the result proves the trajectory planning according with dynamics, characteristic.
Statistical multiplexing, admission region, and contention window optimization in multiclass wireless LANs
Authors: Yu Cheng, Xinhua Ling, Lin X. Cai, Wei Song, Weihua Zhuang, Xuemin Shen, Alberto Leon-Garcia
Venue: Wireless Networks (2009)

This paper presents an analytical model for evaluating the statistical multiplexing effect, admission region, and contention window design in multiclass wireless local area networks (WLANs). We consider distributed medium access control (MAC) which provisions service differentiation by assigning different contention windows to different classes. Mobile nodes belonging to different classes may have heterogeneous traffic arrival processes with different quality of service (QoS) requirements. With bursty input traffic, e.g. on/off sources, our analysis shows that the WLAN admission region under the QoS constraint can be significantly improved, when the statistical multiplexing effect is taken into account. We also analyze the MAC resource sharing between the short-range dependent (SRD) on/off sources and the long-range dependent (LRD) fractional Brownian motion (FBM) traffic, where the impact of the Hurst parameter on the admission region is investigated. Moveover, we demonstrate that the proper selection of contention windows plays an important role in improving the WLAN's QoS capability, while the optimal contention window for each class and the maximum admission region can be jointly solved in our analytical model. The analysis accuracy and the resource utilization improvement from statistical multiplexing gain and contention window optimization are demonstrated by extensive numerical results.
Performance and Waiting-Time Predictability Analysis of Design Options in Cost-Based Scheduling for Scalable Media Streaming
Authors: Mohammad A. Alsmirat, Nabil J. Sarhan
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

Motivated by the impressive performance of cost-based scheduling for media streaming, we investigate its effectiveness in detail and analyze opportunities for further tunings and enhancements. Guided by this analysis, we propose a highly efficient enhancement technique that optimizes the scheduling decisions to increase the number of requests serviced concurrently and enhance user-perceived quality-of-service. We also analyze the waiting-time predictability achieved by the new technique. The simulation results show that it can achieve significant performance improvements while providing users with highly accurate expected waiting times.
Scene-Motion Thresholds Correlate with Angular Head Motions for Immersive Virtual Environments
Authors: Jason Jerald, Frank Steinicke, Mary Whitton
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

To better understand motion perception in immersive virtual environments, we conducted a user study to quantify perception of scene motion as subjects yawed their heads. We measured psychometric functions of scene-velocity thresholds for different head motions and then extracted 75\% thresholds, creating scene-velocity thresholds as functions of three measures of head motion: 1) Angular Range, 2) Peak Angular Velocity, 3) and Peak Angular Acceleration. We also measured scene-velocity thresholds for four phases of head motion: 1) the Start of the head turn, 2) the Center of the head turn, 3) the End of the head turn, 4) and All of the head turn. Scene-velocity thresholds increased as head motion increased for all tested conditions.
Space Efficient String Mining under Frequency Constraints
Authors: Johannes Fischer, Veli Mäkinen, Niki Välimäki
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Let $\db_1$ and $\db_2$ be two databases (i.e. multisets) of $d$ strings, over an alphabet $\Sigma$, with overall length $n$. We study the problem of mining discriminative patterns between $\db_1$ and $\db_2$ --- e.g., patterns that are frequent in one database but not in the other, emerging patterns, or patterns satisfying other frequency-related constraints. Using the algorithmic framework by Hui (CPM 1992), one can solve several variants of this problem in the optimal linear time with the aid of suffix trees or suffix arrays. This stands in high contrast to other pattern domains such as itemsets or subgraphs, where super-linear lower bounds are known. However, the space requirement of existing solutions is $O(n \log n)$ bits, which is not optimal for $|\Sigma
Adaptive partial dominating set algorithm for mobile ad-hoc networks
Authors: A Nagaraju, S Ramachandram
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

In Mobile Ad-hoc Networks (MANETs) each node has a transmission radius and is able to send message to all of its neighbors that are located with in its radius. In reactive based routing algorithms such as Ad-hoc on demand Routing Algorithm (AODV) and Dynamic Source Routing Algorithm (DSR) a node broadcasts control information (Route Request, Route Reply, and Route Error) to all its neighbor nodes. In this paper we modify the existing Partial Dominant Pruning algorithm to find adaptive dominating set by reducing the coverage area of a node which desires to send control information. It does not require any communication over head to reduce the coverage area.
Numerical Simulation of Shock Wave Diffraction on the Sphere in the Shock Tube
Authors: Sergey N. Martyushov, Yanina G. Martyushova
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

In non-stationary problems of flows, for example problem of shock wave diffraction on a flying body, the impulse of appearing drag force generates non-stationary forward and rotary movement of the body. The describing mathematical model is nonlinear not only with respect to coefficients of system of the equations, but also in the sense of dependence of the system of equations and boundary conditions from integral characteristics of the decision (drag force and its moment relative to the center of mass of the body). The purpose of this work is realization of computing aspects of numerical simulation of such problems by modern numerical algorithms on the example of model problem of shock wave diffraction on sphere in the shock tube. The problem was numerically simulated on the basis of the difference scheme of second order accuracy [1,2]. The 3-D structured grids construction was performed by algorithm based on the Poisson equations decision [5,6].
A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems
Authors: Hongfeng Wang, Dingwei Wang, Shengxiang Yang
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

Dynamic optimization problems challenge traditional evolutionary algorithms seriously since they, once converged, cannot adapt quickly to environmental changes. This paper investigates the application of memetic algorithms, a class of hybrid evolutionary algorithms, for dynamic optimization problems. An adaptive hill climbing method is proposed as the local search technique in the framework of memetic algorithms, which combines the features of greedy crossover-based hill climbing and steepest mutation-based hill climbing. In order to address the convergence problem, two diversity maintaining methods, called adaptive dual mapping and triggered random immigrants, respectively, are also introduced into the proposed memetic algorithm for dynamic optimization problems. Based on a series of dynamic problems generated from several stationary benchmark problems, experiments are carried out to investigate the performance of the proposed memetic algorithm in comparison with some peer evolutionary algorithms. The experimental results show the efficiency of the proposed memetic algorithm in dynamic environments.
Mobile service oriented architectures for NN-queries
Authors: Agustinus Borgy Waluyo, David Taniar, Wenny Rahayu, Bala Srinivasan
Venue: Journal of Network and Computer Applications (2009)

The ever-increasing number of mobile device users has also raised the users' expectation of mobile services accordingly. This phenomenon has given pressures to the mobile service providers to improve their services in order to stay competitive in the market. The service oriented approach is seen to be a promising scheme for mobile services. This paper presents mobile service oriented architectures for Nearest-Neighbor (NN) queries that are classified into five categories, namely (i) intermittent query mobile services, (ii) continuous query mobile services, (iii) context-aware mobile services, (iv) continuous moving object query mobile services, and (v) data broadcast mobile services. These services incorporate query, location and context-aware services, ontological context model, and broadcast. The proposed architectures are concerned with mobile services for clients on the move requesting services based on their current location, which is arguably the most important feature in a wireless environment. Furthermore, we also discuss the Quality-of-Service (QoS) requirement for mobile services in which request latency time is one of the most important parameters to consider. Some analytical models for query latency measurement are presented and the results are compared with the simulation experiments.
A-twitter over Twitter
Authors: Alan Zeichick
Venue: netWorker (2009)

Sometimes I feel like I'm the only person in the world who doesn't "get" Twitter. Paradoxically, many of my friends tell me they feel the same way.
Interaction design and experiential factors: a novel case study on digital pen and paper
Authors: Musstanser Tinauli, Margherita Pillan
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

The importance of Interaction Design (IxD) has been on the increase for the last couple of years. The success of Ipod and failure of Jukebox justify the significance of the discipline. In this paper we present a generic methodology to evaluate any interactive system. Eight factors form the basis of the evaluation process. These factors include Learnability, Usage, Error and Feedback, Comfort, Collaboration, Affect, Guidance and Support and Accessibility. Each factor is measured independently and the resulting numbers contribute to the overall evaluation of the interactive system under observation. A novel case study to evaluate the use of digital pen and paper in a real life scenario is also presented in the paper.
Evaluation of General Set Expressions
Authors: Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We consider the problem of evaluating an expression over sets. The sets are preprocessed and are therefore sorted, and the operators can be any of union, intersection, difference, complement, and symmetric difference (exclusive union). Given the expression as a formula and the sizes of the input sets, we are interested in the worst-case complexity of evaluation (in terms of the size of the sets). The problem is motivated by document retrieval in search engines where a user query translates directly to an expression over the sets containing the user-entered words. Special cases of of this problem have been studied [7,6] where the expression has a restricted form. In this paper, we present an efficient algorithm to evaluate the most general form of a set expression. We show a lower bound on this problem for expressions of the form E 1, or E 1 -E 2 where E 1 and E 2 are expressions with union, intersection, and symmetric difference operators. We demonstrate that the algorithm's complexity matches the lower bound in these instances. We, moreover, conjecture that the algorithm works optimally, even when we allow difference and complement operations in E 1 and E 2.
An edge detection approach based on directional wavelet transform
Authors: Zhen Zhang, Siliang Ma, Hui Liu, Yuexin Gong
Venue: Computers Mathematics with Applications (2009)

The standard 2D wavelet transform (WT) has been an effective tool in image processing. In recent years, many new transforms have been proposed successively, such as curvelets, bandlets, directional wavelet transform etc, which inherit the merits of the standard WT, and are more adequate at the 2D image processing tasks. Intuitively, it seemed that applying these novel tools to edge detection should acquire finer performance. In this paper, we propose an edge detection approach based on directional wavelet transform which retains the separable filtering and the simplicity of computations and filter design from the standard 2D WT. In addition, the corresponding gradient magnitude is redefined and a new algorithm for non-maximum suppression is described. The experimental results of edge detection for several test images are provided to demonstrate our approach.
A dispatching method for automated lifting vehicles in automated port container terminals
Authors: Vu Duc Nguyen, Kap Hwan Kim
Venue: Computers and Industrial Engineering (2009)

In automated container terminals, containers are transported from the marshalling yard to a ship and vice versa by automated vehicles. The automated vehicle type studied in this paper is an automated lifting vehicle (ALV) that is capable of lifting a container from the ground by itself. This study discusses how to dispatch ALVs by utilizing information about pickup and delivery locations and time in future delivery tasks. A mixed-integer programming model is provided for assigning optimal delivery tasks to ALVs. A procedure for converting buffer constraints into time window constraints and a heuristic algorithm for overcoming the excessive computational time required for solving the mathematical model are suggested. Numerical experiments are reported to compare the objective values and computational times by a heuristic algorithm with those by an optimizing method and to analyze the effects of dual cycle operation, number of ALVs, and buffer capacity on the performance of ALVs.
RFID Enhancement in Road Traffic Analysis by Augmenting Reciever with TelegraphCQ
Authors: Faraz Khan, Nadeem Akhtar, Mohammed A. Qadeer
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The Radio Frequency Identification (RFID) tags are an integral part of lives today, whether realized or not. Thousands of applications are currently using RFID tags and the number is growing. RFID finds its application in fields as diverse as race timing, transportation payments, passports, & animal identification. This paper aims at combining the ubiquitous applicability of RFIDs with high speed live stream querying capabilities of TelegraphCQ. This paper also aims at providing means of data mining with this accumulated data. The fulcrum of RFID application for this paper is Road Traffic analysis but this can easily be generalized to include above mentioned RFID applications also.