ppxscal/embedding_network huggingface dataset:
Hybrid genetic algorithm with adaptive local search scheme
Authors: YoungSu Yun
Venue: Computers and Industrial Engineering (2006)

This paper proposes a hybrid genetic algorithm (a-hGA) with adaptive local search scheme. For designing the a-hGA, a local search technique is incorporated in the loop of genetic algorithm (GA), and whether or not the local search technique is used in the GA is automatically determined by the adaptive local search scheme. Two modes of adaptive local search schemes are developed in this paper. First mode is to use the conditional local search method that can measure the average fitness values obtained from the continuous two generations of the a-hGA, while second one is to apply the similarity coefficient method that can measure a similarity among the individuals of the population of the a-hGA. These two adaptive local search schemes are included in the a-hGA loop, respectively. Therefore, the a-hGA can be divided into two types: a- hGA1 and a-hGA2. To prove the efficiency of the a-hGA1 and a-hGA2, a canonical GA (cGA) and a hybrid GA (hGA) with local search technique and without any adaptive local search scheme are also presented. In numerical example, all the algorithms (cGA, hGA, a-hGA1 and a-hGA2) are tested and analyzed. Finally, the efficiency of the proposed a-hGA1 and a-hGA2 is proved by various measures of performance.
On the twin measure and system predictability and fairness
Authors: David Raz, Hanoch Levy, Benjamin Avi-Itzhak
Venue: ACM SIGMETRICS Performance Evaluation Review (2006)

Two identical customers with deterministically identical service times arrive at a queueing system simultaneously (Twins), but leave the system 2 hours apart. Is their sojourn time predictable? Is the system fair? We propose a novel measure based on the principle that in a predictable and fair system, "twin" customers should not depart the system very far apart. We analyze this measure for a number of common service policies and compare the results. We compare the results to those of other fairness and predictability approaches proposed recently and discuss its usefulness.
Crowd simulation for emergency response using BDI agent based on virtual reality
Authors: Ameya Shendarkar, Karthik Vasudevan, Seungho Lee, Young-Jun Son
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This paper presents a novel VR (Virtual Reality) trained BDI (belief, desire, intention) software agent used to construct crowd simulations for emergency response. The BDI framework allows modeling of human behavior with a high degree of fidelity. The proposed simulation has been developed using AnyLogic software to mimic crowd evacuation from an area under a terrorist bomb attack. The attributes that govern the BDI characteristics of the agent are studied by conducting human in the loop experiments in VR using the CAVE (Cave Automatic Virtual Environment). To enhance generality and interoperability of the proposed crowd simulation modeling scheme, input data models have been developed to define environment attributes. Experiments are also conducted to demonstrate the effect of various parameters on key performance indicators such as crowd evacuation rate and densities.
The effects of metaphors on novice and expert learners' performance and mental-model development
Authors: Yu-chen Hsu
Venue: Interacting with Computers (2006)

The effects of metaphors on learning have been proved by many studies. Learners naturally invoke metaphors when learning new concepts because metaphors stimulate them to generate models of the domain to be learned. However, little evidence has been seen of metaphors' effect on developing learners' mental models. Since metaphors function by providing familiar concepts that help learners to construct new knowledge, metaphors' effects may be more apparent to novice learners. This study explores the effects of metaphors on both novice and expert learners' performance and their mental-model development as documented by three different measurement methods. It also examines the relationship between subjects' performance and their mental models. The results indicate that metaphors may facilitate novices' construction of integrative knowledge but not simple knowledge. In addition, metaphors may possibly have lasting effects on expert learning but the effects may not be seen immediately after learning.
Progressive deforming meshes based on deformation oriented decimation and dynamic connectivity updating
Authors: Fu-Chung Huang, Bing-Yu Chen, Yung-Yu Chuang
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

We present a method for progressive deforming meshes. Most existing mesh decimation methods focus on static meshes. However, there are more and more animation data today, and it is important to address the problem of simplifying deforming meshes. Our method is based on deformation oriented decimation (DOD) error metric and dynamic connectivity updating (DCU) algorithm. Deformation oriented decimation extends the deformation sensitivity decimation (DSD) error metric by augmenting an additional term to model the distortion introduced by deformation. This new metric preserves not only geometric features but also areas with large deformation. Using this metric, a static reference connectivity is extracted for the whole animation. Dynamic connectivity updating algorithm utilizes vertex trees to further reduce geometric distortion by allowing the connectivity to change. Temporal coherence in the dynamic connectivity between frames is achieved by penalizing large deviations from the reference connectivity. The combination of DOD and DCU demonstrates better simplification and triangulation performance than previous methods for deforming mesh simplification.
Multiple alignment by sequence annealing
Authors: Ariel S. Schwartz, Lior Pachter
Venue: Bioinformatics (2007)

Motivation: We introduce a novel approach to multiple alignment that is based on an algorithm for rapidly checking whether single matches are consistent with a partial multiple alignment. This leads to a sequence annealing algorithm, which is an incremental method for building multiple sequence alignments one match at a time. Our approach improves significantly on the standard progressive alignment approach to multiple alignment. Results: The sequence annealing algorithm performs well on benchmark test sets of protein sequences. It is not only sensitive, but also specific, drastically reducing the number of incorrectly aligned residues in comparison to other programs. The method allows for adjustment of the sensitivity/specificity tradeoff and can be used to reliably identify homologous regions among protein sequences. Availability: An implementation of the sequence annealing algorithm is available at http://bio.math.berkeley.edu/amap/ Contact: sariel@cs.berkeley.edu
Organizing and Editing Your Photos with Picasa: Visual QuickProject Guide
Authors: Steve Schwartz
Venue:  (2005)

If you're looking for an easy way to find photos on your PC, make a few editing fixes, and then share your images with others, look no further. Picasa, available as a free download from Google.com, makes it easy to instantly find, edit and share all the pictures on your PC. Every time you open Picasa, it automatically locates all your pictures in seconds and sorts them into albums. From there, you can apply basic edits to your photos, burn them to CD, post them on your blog, or email them to friends. In this colorful, compact guide, author Steve Schwartz starts at the beginning, walking readers through the Picasa interface and showing readers how to set preferences. From there, he launches into the heart of this book, offering project-based instruction for organizing, viewing, and editing your photos, and then shows you how to use Picasa's built-in tools to print, email, or order professional prints of your images. In addition, readers will learn how to share their photos instantly with Hello, Picasa's free instant messaging software. Throughout the book, full-page, full-color screen shots and simple, step-by-step instructions lead readers through several projects, such as saving an image to the Windows desktop, creating a screensaver, making movies, generating photo-based Web pages, running a slideshow, and creating posters, collages, and contact sheets.
Allocating field service teams with simulation in energy/utilities environment
Authors: Luiz Augusto G. Franzese, Marcelo Moretti Fioroni, Luis Eduardo Pinheiro, João Batista Eustáchio Soares
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Field Service Teams (FSTs) allocation problems are usually addressed with Linear Programming models. But when certain models can be very complex, especially if allocation rules are dynamic, pooled resources can be used and variation is effective. In order to better analyze FSTs allocation problems for Utilities segment, simulation was used to power CAPSIM, which has been validated and used by ELEKTRO S.A., one of the largest Energy Distributors in Brazil. This paper addresses problem conceptualization, model design and calibration, as well as results and future steps.
Scalable and structured scheduling
Authors: Paul Feautrier
Venue: International Journal of Parallel Programming (2006)

Scheduling a program (i.e. constructing a timetable for the execution of its operations) is one of the most powerful methods for automatic parallelization. A schedule gives a blueprint for constructing a synchronous program, suitable for an ASIC or VLIW processor. However, constructing a schedule entails solving a large linear program. Even if one accepts the (experimental) fact that the Simplex is almost always polynomial, the scheduling time is of the order of a large power of the program size. Hence, the method does not scale well. The present paper proposes two methods for improving the situation. First, a large program can be divided into smaller units (processes), which can be scheduled separately. This is structured scheduling. Second, one can use projection methods for solving linear programs incrementally. This is specially efficient if the dependence graph is sparse.
Conservative aspect-orientated programming with the e language
Authors: Matan Vax
Venue: Proceedings of the 6th international conference on Aspect-oriented software development (2007)

e is a programming language designed for modeling and verification of electronic systems. As such it is used extensively in the microchip industry, and was recently declared an IEEE standard, e is also a powerful general-purpose language used in the implementation of complex commercial software tools.It was suggested some time ago that a number of idioms in e resemble those of AOP, but the suggestion was never examined in depth. The present paper takes up this task. For this purpose the relevant mechanisms in e are compared with those of today's prominent aspect-oriented language - AspectJ - with respect to syntax, semantics, and application.e's aspect-oriented capabilities turn out to be a small subset of AspectJ's, but an interesting one. It is weaker in its support for implementing developmental and non-functional concerns. However, with its simpler syntax and economical semantics, e captures in a natural way crosscutting concerns that stem from the application domain. Thus, e seems to exemplify an original variant of AOP - one that is conservative and robust from a software design point of view.
Contextualizing usage research for interactive technology: the case of car e-tailing
Authors: Ulrike Schultze, Traci A. Carte
Venue: ACM SIGMIS Database (2007)

E-Commerce technologies are interactive in nature, yet most research on E-Commerce adoption and use fails to consider this feature and the technology's social context of use in its theorizing. In this paper, we seek to theorize the technological feature of interactivity in a social context of information asymmetry by studying the use of E-Commerce technology among car sales associates in the US. Drawing on Social Exchange Theory (Kelley, 1979), we develop a model of interactive technology use that incorporates the user's beliefs about his/her exchange partner, the user's attitude toward technology use and the technology's perceived usefulness for the work process it is impacting. After refining our model with insights gained from observations of and interviews with a few car sales associates, we then test our contextualized model of E-Commerce use with data collected from a national survey of car sales associates (n=137).Our results show that attitude and users' beliefs about their exchange partners improve our ability to predict IT use. Furthermore, the contexualization of TAM highlights the theory's assumptions about the unemotional and individually-focused nature of users' decision making with respect to IT use.
A User-Habit Property: Haunting of Users in IP Networks
Authors: Ping Wang, Binxing Fang, Xiaochun Yun, Jun Zheng
Venue: IEICE - Transactions on Information and Systems (2007)

We focus on the overall representation of network user behavior and observe that the number of destinations accessed by a network user is limited, which means users have certain preferential haunts in networks. And the distribution of users closely matches heavy tail distribution instead of Possion Distribution.
Graph bandwidth of weighted caterpillars
Authors: Mingen Lin, Zhiyong Lin, Jinhui Xu
Venue: Theoretical Computer Science (2006)

Graph bandwidth minimization (GBM) is a classical and challenging problem in graph algorithms and combinatorial optimization. Most of existing researches on this problem have focused on unweighted graphs. In this paper, we study the bandwidth minimization problem of weighted caterpillars, and propose several algorithms for solving various types of caterpillars and general graphs. More specifically, we show that the GBM problem on caterpillars with hair-length at most 2 and the GBM problem on star-shape caterpillars are NP-complete, and give a lower bound of the graph bandwidth for general weighted graphs. For caterpillars with hair-length at most 1, we present an O(n log n log(nwmax))-time algorithm to compute an optimal bandwidth layout, where n is the total number of vertices in the graph and wmax is the maximum wedge weight. For caterpillars with hair-length at most k, we give a k-approximation algorithm. For arbitrary caterpillars and general graphs, we give a heuristic algorithm and some experimental results. Experiments show that the solutions obtained by our heuristic algorithm are roughly within a factor of clog(n) of the lower bound for a small number c, which is consistent with the inapproximability results of this problem (i.e., no constant approximation for the GBM problem unless P = NP).
Packet delay in optical circuit-switched networks
Authors: Zvi Rosberg, Andrew Zalesky, Moshe Zukerman
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

A framework is provided for evaluation of packet delay distribution in an optical circuit-switched network. The framework is based on a fluid traffic model, packet queueing at edge routers, and circuit-switched transmission between edge routers. Packets are assigned to buffers according to their destination, delay constraint, physical route and wavelength. At every decision epoch, a subset of buffers is allocated to end-to-end circuits for transmission, where circuit holding times are based on limited and exhaustive circuit allocation policies. To ensure computational tractability, the framework approximates the evolution of each buffer independently. "Slack variables" are introduced to decouple amongst buffers in a way that the evolution of each buffer remains consistent with all other buffers in the network. The delay distribution is derived for a single buffer and an approximation is given for a network of buffers. The approximation entails finding a fixed point for the functional relation between the "slack variables" and a specific circuit allocation policy. An analysis of a specific policy, in which circuits are probabilistically allocated based on buffer size, is given as an illustrative example. The framework is shown to be in good agreement with a discrete event simulation model.
A method for conflict detection based on team intention inference
Authors: Taro Kanno, Keiichi Nakata, Kazuo Furuta
Venue: Interacting with Computers (2006)

One of the typical causes of errors in team cooperative activities, such as in central control rooms of power plants and cockpits in aircrafts, is conflicts among team members' intentions. If mutual awareness and communication were perfectly established and maintained, conflicts could be detected and recovered by team members; however, this does not happen in practice. In this paper, we provide a framework for detecting conflicts among team members' intentions based on team intention inference, aiming to make machines function as a coordinator for cooperative activities. In previous work, we developed a method for team intention inference based on a definition of 'we-intention'. We-intention is other-regarding intentions relating to situations in which some agents act together, and is represented as a set of individual intentions and mutual beliefs. In this framework, a conflict can be defined as a set of individual intentions and false beliefs (undesired procedures), and detected by searching for such combinations. We applied the proposed method to the operation of a plant simulator operated by a two-person team, and it was confirmed through an experiment that this method could list candidates for conflicts by type and set the actual conflict high in priority in the tested context.
Evolving dynamic Bayesian networks with Multi-objective genetic algorithms
Authors: Brian J. Ross, Eduardo Zuviria
Venue: Applied Intelligence (2007)

A dynamic Bayesian network (DBN) is a probabilistic network that models interdependent entities that change over time. Given example sequences of multivariate data, we use a genetic algorithm to synthesize a network structure that models the causal relationships that explain the sequence. We use a multi-objective evaluation strategy with a genetic algorithm. The multi-objective criteria are a network's probabilistic score and structural complexity score. Our use of Pareto ranking is ideal for this application, because it naturally balances the effect of the likelihood and structural simplicity terms used in the BIC network evaluation heuristic. We use a basic structural scoring formula, which tries to keep the number of links in the network approximately equivalent to the number of variables. We also use a simple representation that favors sparsely connected networks similar in structure to those modeling biological phenomenon. Our experiments show promising results when evolving networks ranging from 10 to 30 variables, using a maximal connectivity of between 3 and 4 parents per node. The results from the multi-objective GA were superior to those obtained with a single objective GA.
Flash 8 Cookbook (Cookbooks (O'Reilly))
Authors: Joey Lott
Venue:  (2006)

This practical, nuts-and-bolts toolkit puts theory into practice with ready-made answers to common Flash development questions. It's the perfect resource for Flash developers, as well as designers who are ready to start doing development work.Flash 8 Cookbook offers quick look-up (and cross-referenced) recipes in four main categories:Creating Flash ContentBuilding Interactive Flash InterfacesAdding Multimedia and DataPlanning Flash ProjectsUsing O'Reilly's popular Problem/Solution/Discussion Cookbook format, this book offers 280 standalone recipes that include a brief explanation of how and why the solution works, so you can adapt it to similar situations you may run across in the future. For people who say, "I understand everything in theory, but I don't know where to start in practice," this book offers ready-to-use answers to real-world problems.Joey Lott is the author of ActionScript Cookbook (O'Reilly) and co-author of Flash MX 2004 ActionScript Bible (Wiley). He's a leading speaker and consultant in the Flash development community.
A VR-based hyper interaction platform
Authors: Chun-Hong Huang, Hui-Huang Hsu, Timothy K. Shih, Rong-Chi Chang
Venue: Proceedings of the 38th conference on Winter simulation (2006)

We present a hyper-interaction platform which integrates several newly developed techniques, including motion classification, a motion reaction control mechanism and a high precision 3-D model of the International Space Station. The goal is to build an interaction platform for trainers to navigate in a virtual reality. The platform can be applied to customized mission training. The system integrated visualization environment, underlying 3-D model, and a human body tracking mechanism. The tracking system will be extended to 3-D coordination reconstruction and thus behaviors of users can be precisely identified. These navigation parameters are used in controlling navigation in the 3-D virtual environment. Another important issue of this system is to define a model for motion reaction. The definition of reaction can be applied to avatars or to the virtual environment. These integrated technologies can also be used in other virtual reality environments.
Schaum's Outline of Principles of Computer Science, 1 edition
Authors: Paul Tymann, Carl Reynolds
Venue:  (2008)

Learn the essentials of computer science Schaum’s Outline of Principles of Computer Science provides a concise overview of the theoretical foundation of computer science. It also includes focused review of object-oriented programming using Java.Table of contentsChapter 1. Introduction to Computer ScienceChapter 2. AlgorithmsChapter 3. Computer OrganizationChapter 4. SoftwareChapter 5. Programming in JavaChapter 6. Operating SystemsChapter 7. NetworkingChapter 8. DatabaseChapter 9. Social IssuesAppendix: Answers to Review QuestionsIndex
Optimization techniques for approximation with subdivision surfaces
Authors: M. Marinov, L. Kobbelt
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

We present a method for scattered data approximation with subdivision surfaces which actually uses the true representation of the limit surface as a linear combination of smooth basis functions associated with the control vertices. This is unlike previous techniques which used only piecewise linear approximations of the limit surface. By this we can assign arbitrary parameterizations to the given sample points, including those generated by parameter correction. We present a robust and fast algorithm for exact closest point search on Loop surfaces by combining Newton iteration and non-linear minimization. Based on this we perform unconditionally convergent parameter correction to optimize the approximation with respect to the L2 metric and thus we make a well-established scattered data fitting technique which has been available before only for B-spline surfaces, applicable to subdivision surfaces. Further we exploit the fact that the control mesh of a subdivision surface can have arbitrary connectivity to reduce the L&infin; error up to a certain user-defined tolerance by adaptively restructuring the control mesh. By employing iterative least squares solvers, we achieve acceptable running times even for large amounts of data and we obtain high quality approximations by surfaces with relatively low control mesh complexity compared to the number of sample points. Since we are using plain subdivision surfaces, there is no need for multiresolution detail coefficients and we do not have to deal with the additional overhead in data and computational complexity associated with them.