ppxscal/embedding_network huggingface dataset:
Programming Flex 2: The Comprehensive Guide to Creating Rich Media Applications with Adobe Flex
Authors: Chafic Kazoun, Joey Lott
Venue:  (2007)

Is there an easier way to build and deliver rich internet applications (RIAs) other than the Flash IDE or Ajax? Absolutely. With Adobe Flex 2, the Flex 2 SDK, and this book, you have all you need to build RIAs. Programming Flex 2 offers you plenty of practical and useful examples that reveal how and why to use a particular feature of Flex 2, and when and when not to.As part of the Adobe Developer Library, Programming Flex 2 is the authoritative guide to this new Adobe framework. You learn to use a markup language called MXML and a vast library of off-the-shelf and highly-configurable components to build Flash-based applications that combine the immediacy of the Web with the functionality and responsiveness of desktop applications. You also discover why -- with the Flash Player runtime environment and the powerful ActionScript 3.0 programming language -- the possibilities with Flex 2 are nearly limitless.Topics include:Managing LayoutWorking with ComponentsWorking with MediaManaging StateUsing Transitions and EffectsWorking with DataCustomizing Application AppearanceClient Data Communication and Remote Data CommunicationDebugging Flex Framework ApplicationsCreating Custom ComponentsFlex may be easier to learn than the Flash IDE, but you still need a reliable guide to the framework. Programming Flex 2 not only serves as a reference, but provides valuable and practical insight into this new technology. As you learn how to build Flex applications, you'll also discover how Flex works. This book supplies all the information you need in one convenient place.Adobe Developer Library is a co-publishing partnership between O'Reilly Media and Adobe Systems, Inc. and is designed to produce the number one information resources for developers who use Adobe technologies. Created in 2006, the Adobe Developer Library is the official source for comprehensive learning solutions to help developers create expressive and interactive web applications that can reach virtually anyone on any platform. With top-notch books and innovative online resources covering the latest in rich Internet application development, the Adobe Developer Library offers expert training and in-depth resources, straight from the source.
Pricing the internet with multibid auctions
Authors: Patrick Maillé, Bruno Tuffin
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

Usage-based or congestion-based charging schemes have been regarded as a relevant way to control congestion and to differentiate services among users in telecommunication networks; auctioning for bandwidth appears as one of several possibilities. In a previous work, the authors designed a multibid auction scheme where users compete for bandwidth at a link by submitting several couples (e.g., amount of bandwidth asked, associated unit price) so that the link allocates the bandwidth and computes the charge according to the second price principle. They showed that incentive compatibility and efficiency among other properties are verified. We propose in the present paper to extend this scheme to the case of a network by using the properties/ assumptions that the backbone network is overprovisioned and the access networks have a tree structure.
Rectangle covers revisited computationally
Authors: Laura Heinrich-Litan, Marco E. Lübbecke
Venue: Journal of Experimental Algorithmics (JEA) (2007)

We consider the problem of covering an orthogonal polygon with a minimum number of axis-parallel rectangles from a computational point of view. We propose an integer program which is the first general approach to obtain provably optimal solutions to this well-studied NP-hard problem. It applies to common variants like covering only the corners or the boundary of the polygon and also to the weighted case. In experiments, it turns out that the linear programming relaxation is extremely tight and rounding a fractional solution is an immediate high-quality heuristic. We obtain excellent experimental results for polygons originating from VLSI design, fax data sheets, black and white images, and for random instances. Making use of the dual linear program, we propose a stronger lower bound on the optimum, namely, the cardinality of a fractional stable set. Furthermore, we outline ideas how to make use of this bound in primal--dual-based algorithms. We give partial results, which make us believe that our proposals have a strong potential to settle the main open problem in the area: To find a constant factor approximation algorithm for the rectangle cover problem.
Color-texture image segmentation by integrating directional operators into JSEG method
Authors: Yong-Gang Wang, Jie Yang, Yu-Chou Chang
Venue: Pattern Recognition Letters (2006)

We presented a new color-texture image segmentation method that combined directional operators and the JSEG (J measure based SEGmentation) algorithm. In particular, two major contributions were set forth in this paper. (1) The two measures defined in JSEG and HSEG (H measure based SEGmentation) were discussed respectively and then we found the over-segmentation problem of JSEG could be attributed partly to the absence of color discontinuity in the J measure. Moreover, we have also proven in essence the H measure is isotropic operators for edge detection in images. (2) A new measure was proposed by integrating directional operators into the J measure, on which our segmentation method was based. The new segmentation method took account of both textural homogeneity and color discontinuity in local regions. Performance improvement due to the proposed modification was demonstrated on a variety of real color images.
Special Edition Using WordPerfect Office X3 (Special Edition Using)
Authors: Laura Acklen, Read Gilgen
Venue:  (2006)

Special Edition Using WordPerfect Office X3 is crammed full of tips, tricks, and practical examples that you won't find anywhere else! Covering all of the applications within WordPerfect Office Standard including WordPerfect, Quattro Pro, and Presentations, this is an all-inclusive reference for every user.ï¾ Whether you are just looking to learn the new features of the latest version or need to know how to use the entire feature set more effectively, this book will answer all the questions you have along the way.ï¾
Elimination Transformations for Associative---Commutative Rewriting Systems
Authors: Kusakari Keiichirou, Nakamura Masaki, Toyama Yoshihito
Venue: Journal of Automated Reasoning (2006)

To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990s. Dummy elimination, distribution elimination, general dummy elimination, and improved general dummy elimination are examples of elimination transformations. In this paper we clarify the essence of elimination transformations based on the notion of dependency pairs. We first present a theorem that gives a general and essential property for elimination transformations, making them sound with AC-termination. Based on the theorem, we design an elimination transformation called the argument filtering transformation. Next, we clarify the relation among various elimination transformations by comparing them with a corresponding restricted argument filtering transformation. Finally, we compare the AC-dependency pair method with the argument filtering transformation.
Detecting anomalies in cross-classified streams: a Bayesian approach
Authors: Deepak Agarwal
Venue: Knowledge and Information Systems (2006)

We consider the problem of detecting anomalies in data that arise as multidimensional arrays with each dimension corresponding to the levels of a categorical variable. In typical data mining applications, the number of cells in such arrays are usually large. Our primary focus is detecting anomalies by comparing information at the current time to historical data. Naive approaches advocated in the process control literature do not work well in this scenario due to the multiple testing problem&#x2014;performing multiple statistical tests on the same data produce excessive number of false positives. We use an empirical Bayes method which works by fitting a two-component Gaussian mixture to deviations at current time. The approach is scalable to problems that involve monitoring massive number of cells and fast enough to be potentially useful in many streaming scenarios. We show the superiority of the method relative to a naive &#x201c;per component error rate&#x201d; procedure through simulation. A novel feature of our technique is the ability to suppress deviations that are merely the consequence of sharp changes in the marginal distributions. This research was motivated by the need to extract critical application information and business intelligence from the daily logs that accompany large-scale spoken dialog systems. We illustrate our method on one such system.
Actual morphing: a physics-based approach to blending
Authors: Shi-Min Hu, Chen-Feng Li, Hui Zhang
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

When two topologically identical shapes are blended, various possible transformation paths exist from the source shape to the target shape. Which one is the most plausible? Here we propose that the transformation process should obey a quasi-physical law. This paper combines morphing with deformation theory from continuum mechanics. By using strain energy, which reflects the magnitude of deformation, as an objective function, we convert the problem of path interpolation into an unconstrained optimization problem. To reduce the number of variables in the optimization we adopt shape functions, as used in the finite element method (FEM). A point-to-point correspondence between the source and target shapes is naturally established using these polynomial functions plus a distance map.
Semiparametric estimation of mean and variance functions for non-Gaussian data
Authors: David Nott
Venue: Computational Statistics (2006)

Flexible modelling of the response variance in regression is interesting for understanding the causes of variability in the responses, and is crucial for efficient estimation and correct inference for mean parameters. In this paper we describe methods for mean and variance estimation where the responses are modelled using the double exponential family of distributions and mean and dispersion parameters are described as an additive function of predictors. The additive terms in the model are represented by penalized splines. A simple and unified computational methodology is presented for carrying out the calculations required for Bayesian inference in this class of models based on an adaptive Metropolis algorithm. Application of the adaptive Metropolis algorithm is fully automatic and does not require any kind of pretuning runs. The methodology presented provides flexible methods for modelling heterogeneous Gaussian data, as well as overdispersed and underdispersed count data. Performance is considered in a variety of examples involving real and simulated data sets.
Proving the shalls: Early validation of requirements through formal methods
Authors: Steven P. Miller, Alan C. Tribble, Michael W. Whalen, Mats P. E. Heimdahl
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2006)

Incomplete, inaccurate, ambiguous, and vola-tile requirements have plagued the software industry since its inception. The convergence of model-based development and formal methods offers developers of safety-critical systems a powerful new approach to the early validation of requirements. This paper describes an exercise conducted to determine if formal methods could be used to validate system requirements early in the lifecycle at reasonable cost. Several hundred functional and safety requirements for the mode logic of a typical flight guidance system were captured as natural language &#x201c;shall&#x201d; statements. A formal model of the mode logic was written in the RSML&#x2212;e language and translated into the NuSMV model checker and the PVS theorem prover using translators developed as part of the project. Each &#x201c;shall&#x201d; statement was manually translated into a NuSMV or PVS property and proven using these tools. Numerous errors were found in both the original requirements and the RSML&#x2212;e model. This demonstrates that formal models can be written for realistic systems and that formal analysis tools have matured to the point where they can be effectively used to find errors before implementation.
A spectral approach to learning structural variations in graphs
Authors: Bin Luo, Richard C. Wilson, Edwin R. Hancock
Venue: Pattern Recognition (2006)

This paper shows how to construct a linear deformable model for graph structure by performing principal components analysis (PCA) on the vectorised adjacency matrix. We commence by using correspondence information to place the nodes of each of a set of graphs in a standard reference order. Using the correspondences order, we convert the adjacency matrices to long-vectors and compute the long-vector covariance matrix. By projecting the vectorised adjacency matrices onto the leading eigenvectors of the covariance matrix, we embed the graphs in a pattern-space. We illustrate the utility of the resulting method for shape-analysis.
On the community-based explanation of search results
Authors: Maurice Coyle, Barry Smyth
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

Collaborative Web search (CWS) is an approach to personalizing search results, returned by an underlying search engine(s), to the preferences of a community of like-minded searchers. In this paper we propose an alternative architecture that facilitates a more flexible integration between CWS and the underlying search engine(s) and evaluate how community behaviour can be used to annotate search results with explanatory information to facilitate relevancy judgments.
Incorporating multiple SVMs for automatic image annotation
Authors: Xiaojun Qi, Yutao Han
Venue: Pattern Recognition (2007)

In this paper, a novel automatic image annotation system is proposed, which integrates two sets of support vector machines (SVMs), namely the multiple instance learning (MIL)-based and global-feature-based SVMs, for annotation. The MIL-based bag features are obtained by applying MIL on the image blocks, where the enhanced diversity density (DD) algorithm and a faster searching algorithm are applied to improve the efficiency and accuracy. They are further input to a set of SVMs for finding the optimum hyperplanes to annotate training images. Similarly, global color and texture features, including color histogram and modified edge histogram, are fed into another set of SVMs for categorizing training images. Consequently, two sets of image features are constructed for each test image and are, respectively, sent to the two sets of SVMs, whose outputs are incorporated by an automatic weight estimation method to obtain the final annotation results. Our proposed annotation approach demonstrates a promising performance for an image database of 12000 general-purpose images from COREL, as compared with some current peer systems in the literature.
Model-Based performance prediction with the palladio component model
Authors: Steffen Becker, Heiko Koziolek, Ralf Reussner
Venue: Proceedings of the 6th international workshop on Software and performance (2007)

One aim of component-based software engineering (CBSE) is to enable the prediction of extra-functional properties, such as performance and reliability, utilising a well-defined composition theory. Nowadays, such theories and their accompanying prediction methods are still in a maturation stage. Several factors influencing extra-functional properties need additional research to be understood. A special problem in CBSE stems from its specific development process: Software components should be specified and implemented independent from their later context to enable reuse. Thus, extra-functional properties of components need to be specified in a parametric way to take different influence factors like the hardware platform or the usage profile into account. In our approach, we use the Palladio Component Model (PCM) to specify component-based software architectures in a parametric way. This model offers direct support of the CBSE development process by dividing the model creation among the developer roles. In this paper, we present our model and a simulation tool based on it, which is capable of making performance predictions. Within a case study, we show that the resulting prediction accuracy can be sufficient to support the evaluation of architectural design decisions.
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem
Authors: Silvano Martello, David Pisinger, Daniele Vigo, Edgar Den Boef, Jan Korst
Venue: ACM Transactions on Mathematical Software (TOMS) (2007)

We consider the problem of orthogonally packing a given set of rectangular-shaped boxes into the minimum number of three-dimensional rectangular bins. The problem is NP-hard in the strong sense and extremely difficult to solve in practice. We characterize relevant subclasses of packing and present an algorithm which is able to solve moderately large instances to optimality. Extensive computational experiments compare the algorithm for the three-dimensional bin packing when solving general orthogonal packings and when restricted to robot packings.
Adobe Premiere Pro Classroom in a Book
Venue:  (2003)

Move over Final Cut Pro. There's a new king of the digital video editing hill, and it doesn't even work on a Mac (though it may be enough to lure some Mac loyalists over). Eschewing cross-platform support for a focus on speed, features, and a quickness to market that was impossible to achieve with both Mac and Windows versions, the brand-new Windows XPï¾¿only Adobe Premiere Pro sets a new standard for desktop digital video editing. Here to get you up to speed on it quickly and efficiently is the first and last word on the subject from the folks behind Premiere Pro--the Adobe Creative Team. This project-based volume covers not just the basics of working with audio, creating transitions, and producing titles but also all that's new (and revolutionary) in Premiere Pro: three-point color correction, multiple timelines, a new audio mixer, enhanced media management, and more. Best of all, the accompanying DVD includes real footage that you can practice on! The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Eye communication in a conversational 3D synthetic agent
Authors: Isabella Poggi, Catherine Pelachaud, Fiorella De Rosis
Venue: AI Communications (2000)

Our goal is to create an &lsquo;intelligent&rsquo; 3D agent able to send complex, &lsquo;natural&rsquo; messages to users and, in the future, to converse with them. We look at the relationship between the agent's communicative intentions and the way that these intentions are expressed into verbal and nonverbal messages. In this paper, we concentrate on the study and generation of coordinated linguistic and gaze communicative acts. In this view we analyse gaze signals according to their functional meaning rather than to their physical actions. We propose a formalism where a communicative act is represented by two elements: a meaning (that corresponds to a set of goals and beliefs that the agent has the purpose to transmit to the interlocutor) and a signal, that is the nonverbal expression of that meaning. We also outline a methodology to generate messages that coordinate verbal with nonverbal signals.
Improved Collision Attacks on MD4 and MD5
Authors: Yu Sasaki, Yusuke Naito, Noboru Kunihiro, Kazuo Ohta
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2007)

At Eurocrypt'05, Wang et al. presented efficient collision attacks on MD5 and MD4 hash functions. They found a collision of MD5 with a complexity of less than 237 MD5 hash operations, and a collision of MD4 with complexity less than 28 MD4 hash operations. In their attack, the procedure to generate a collision is divided into 4 steps. First, they determine the message differential and output differentials of chaining variables in each step, which generates a collision with small complexity. Second, they construct sufficient conditions that guarantee that the desired differential is always calculated. Third, they find a message modification that can satisfy the sufficient conditions with high probability. Finally, they search for a message that satisfies all sufficient conditions. In this paper, we focus on the message modification of MD5 and MD4, and propose a new message modification. Using our message modification, a collision of MD5 can be found with complexity less than 229 MD5 hash operations, and a collision of MD4 can be found with complexity less than 3 MD4 hash operations. To improve the complexity from previous attacks, we mainly use two ideas. The first idea is to use message modification that can satisfy more sufficient conditions in the second round than in previous attacks. The second idea is to use message modification that can enable us to search for a collision starting from an intermediate step.
MySQL Clustering
Authors: Alex Davies, Harrison Fisk
Venue:  (2006)

Clustering is the final component of MySQL that makes it truly enterprise-level and able to compete fully with proprietary databases such as Oracle and Microsoft SQL Server. The increased number of high-demand, high-productivity corporations and institutions choosing MySQL, including MIT, the Department of Homeland Security, NASA, and Nokia, to name a few, need the benefit of clustering databases for high performance and scalability.MySQL AB has stepped up to the plate to offer advanced, high-availability, reliable clustering. As this demand has increased, so has the need for information. MySQL Clustering offers thorough, authoritative instruction on setting up and administering a MySQL Cluster from the developers of the cluster itself. You will learn about everything from installation and configuration to performance and troubleshooting in this authoritative reference guide to MySQL clustering.
Efficient QoS partition and routing of unicast and multicast
Authors: Dean H. Lorenz, Ariel Orda, Danny Raz, Yuval Shavitt
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

In this paper, we study problems related to supporting unicast and multicast connections with quality of service (QoS) requirements. We investigate the problem of optimal routing and resource allocation in the context of performance dependent costs. In this context, each network element can offer several QoS guarantees, each associated with a different cost. This is a natural extension to the commonly used bi-criteria model, where each link is associated with a single delay and a single cost. This framework is simple yet strong enough to model many practical interesting networking problems.An important problems in this framework is finding a good path for a connection that minimizes the cost while retaining the end-to-end delay requirement. Once such a path (or a tree, in the multicast case) is found, one needs to partition the end-to-end QoS requirements among the links of the path (tree). We consider the case of general integer cost functions (where delays and cost are integers). As the related problem is NP complete, we concentrate on finding efficient ε-approximation solutions. We improve on recent previous results by Ergün et al. Lorenz and Orda, and Raz and Shavitt, both in terms of generality as well as in terms of complexity of the solution. In particular, we present novel approximation techniques that yield the best known complexity for the unicast QoS routing problem, and the first approximation algorithm for the QoS partition problem on trees, both for the centralized and distributed cases.