ppxscal/embedding_network huggingface dataset:
Avid Editing, Fourth Edition: A Guide for Beginning and Intermediate Users, 4th edition
Authors: Sam Kauffmann
Venue:  (2009)

Geared toward novice Avid editors, this book provides step-by-step instructions for hundreds of editing tasks and concepts within the Avid software applications. The chapters guide you through an editing project, while the accompanying DVD provides footage to edit allowing for a hands-on experience.More than just a software manual, the book weaves editing principles with the Avid workflow, delving into general editing techniques, principles, and pitfalls, and helping you master the Avid as well as improve your overall editing technique and skillset. Concentrates on the latest Media Composer software, and Mojo DX and Nitris DX hardware.Due to the similarity of Avid's interface across product lines, readers will also find the book relevant forAvid Xpress Pro HD, Xpress Pro, Xpress DV and Avid Symphony. Expanded coverage on HD, DVCPro HD, HDV, and P2 and memory card workflows, DVD authoring and media management and more, preparing editors to work seamlessly with the latest technical updates to Avid. Companion DVD contains two narrative scene and one documentary project allowing you to work along the lessons taught in the bookfootage allowing you to work alongside the lessons taught in the book * New edition of time-tested bestseller is updated with coverage on, Mojo DX and Nitris DX hardware,HD, DVCPro HD, HDV, and P2 and memory card workflows, DVD authoring and media management and more* Unique in that not only is the book a great primer on using Avid, it also effectively teaches editing techniques and concepts helping readers become better technical editors in general* DVD contains footage readers can work along side the text with, further allowing them to focus on improving their editing skills instead of capturing their own footage
Dynamic protocols for open agent systems
Authors: Alexander Artikis
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

Multi-agent systems where the members are developed by parties with competing interests, and where there is no access to a member's internal state, are often classified as 'open'. The specification of protocols for open agent systems of this sort is largely seen as a design-time activity. Moreover, there is no support for run-time specification modification. Due to environmental, social, or other conditions, however, it is often required to revise the specification during the protocol execution. To address this requirement, we present an infrastructure for 'dynamic' protocol specifications, that is, specifications that may be modified at run-time by agents. The infrastructure consists of well-defined procedures for proposing a modification of the 'rules of the game' as well as decision-making over and enactment of proposed modifications. We evaluate proposals for rule modification by modelling dynamic specifications as metric spaces. Furthermore, we constrain the enactment of proposals that do not meet the evaluation criteria. We illustrate our infrastructure by presenting a dynamic specification of a resource-sharing protocol, and an execution of this protocol in which the participating agents modify the protocol specification.
A Combined Segmentation and Registration Framework with a Nonlinear Elasticity Smoother
Authors: Carole Guyader, Luminita A. Vese
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

In this paper, we present a new non-parametric combined segmentation and registration method. The problem is cast as an optimization one, combining a matching criterion based on the active contour without edges [4] for segmentation, and a nonlinear-elasticity-based smoother on the displacement vector field. This modeling is twofold: first, registration is jointly performed with segmentation since guided by the segmentation process; it means that the algorithm produces both a smooth mapping between the two shapes and the segmentation of the object contained in the reference image. Secondly, the use of a nonlinear-elasticity-type regularizer allows large deformations to occur, which makes the model comparable in this point with the viscous fluid registration method [7]. Several applications are proposed to demonstrate the potential of this method to both segmentation of one single image and to registration between two images.
Modeling billiards games
Authors: Christopher Archibald, Yoav Shoham
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

Two-player games of billiards, of the sort seen in recent Computer Olympiads held by the International Computer Games Association, are an emerging area with unique challenges for A.I. research. Complementing the heuristic/algorithmic aspect of billiards, of the sort brought to the fore in the ICGA billiards tournaments, we investigate formal models of such games. The modeling is surprisingly subtle. While sharing features with existing models (including stochastic games, games on a square, recursive games, and extensive form games), our model is distinct, and consequently requires novel analysis. We focus on the basic question of whether the game has an equilibrium. For finite versions of the game it is not hard to show the existence of a pure strategy Markov perfect Nash equilibrium. In the infinite case, it can be shown that under certain conditions a stationary pure strategy Markov perfect Nash equilibrium is guaranteed to exist.
Predicting bounce rates in sponsored search advertisements
Authors: D. Sculley, Robert G. Malkin, Sugato Basu, Roberto J. Bayardo
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

This paper explores an important and relatively unstudied quality measure of a sponsored search advertisement: bounce rate. The bounce rate of an ad can be informally defined as the fraction of users who click on the ad but almost immediately move on to other tasks. A high bounce rate can lead to poor advertiser return on investment, and suggests search engine users may be having a poor experience following the click. In this paper, we first provide quantitative analysis showing that bounce rate is an effective measure of user satisfaction. We then address the question, can we predict bounce rate by analyzing the features of the advertisement? An affirmative answer would allow advertisers and search engines to predict the effectiveness and quality of advertisements before they are shown. We propose solutions to this problem involving large-scale learning methods that leverage features drawn from ad creatives in addition to their keywords and landing pages.
Solving Optimization Problems with DLL
Authors: Enrico Giunchiglia, Marco Maratea
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different application domains, including planning and formal verification. The main reason for this success is that modern SAT solvers can successfully deal with problems having millions of variables. All these solvers are based on the Davis-Logemann-Loveland procedure (DLL). DLL is a decision procedure: Given a formula φ, it returns whether φ is satisfiable or not. Further, DLL can be easily modified in order to return an assignment satisfying φ, assuming one exists. However, in many cases it is not enough to compute a satisfying assignment: Indeed, the returned assignment has also to be “optimal” in some sense, e.g., it has to minimize/maximize a given objective function. In this paper we show that DLL can be very easily adapted in order to solve optimization problems like MAX-SAT and MIN-ONE. In particular these problems are solved by simply imposing an ordering on a set of literals, to be followed while branching. Other popular problems, like DISTANCE-SAT and WEIGHTED-MAX-SAT, can be solved in a similar way. We implemented these ideas in ZCHAFF and the experimental analysis show that the resulting system is competitive with respect to other state-of-the-art systems.
Interference mitigation using successive interference cancellation in optical CDMA systems
Authors: Tawfig Eltaif, Hossam M. H. Shalaby, Sahbudin Shaari, Mohammad M. N. Hamarsheh
Venue: Proceedings of the 8th WSEAS international conference on Microelectronics, nanoelectronics, optoelectronics (2009)

Performance of optical code division multiple access (O-CDMA) system is influenced by multiple access interference (MAI) resulted from the overlapping between the users. To overcome this problem, successive interference cancellation (SIC) scheme is applied to O-CDMA systems. In this paper we apply successive interference cancellation technique to a spectral amplitude coding (SAC) system that uses modified quadratic congruence (MQC) codes as signature sequence codes. The system is analyzed for two cases: same effective power for all the users and different effective power from each user. It is shown that under ideal effective power the SIC/SAC optical CDMA systems have potential to suppress the intensity noise and mitigate multiple access interference. Hence, using SIC/SAC cancellation scheme, the system can accommodate much more number of users as compared to the one without cancellation. Further, under ideal power the system using SIC scheme with direct sequence encoding (SIC/DS) shows much lower BER performance as compared to the one without cancellation (i.e. conventional receiver) or to SIC/SAC cancellation scheme. Hence, much more number of users can be accommodated by SIC/DS receiver system. Furthermore, SIC/DS scheme still shows much lower BER performance as compared with SIC/SAC scheme under different effective power.
When almost all sets are difference dominated
Authors: Peter Hegarty, Steven J. Miller
Venue: Random Structures Algorithms (2009)

We investigate the relationship between the sizes of the sum and difference sets attached to a subset of &lcub;0,1,&hellip;,N&rcub;, chosen randomly according to a binomial model with parameter p(N), with N-1 = o(p(N)). We show that the random subset is almost surely difference dominated, as N &rarr; &infin;, for any choice of p(N) tending to zero, thus confirming a conjecture of Martin and O'Bryant. The proofs use recent strong concentration results. Furthermore, we exhibit a threshold phenomenon regarding the ratio of the size of the difference to the sumset. If p(N) = o(N-1-2) then almost all sums and differences in the random subset are almost surely distinct and, in particular, the difference set is almost surely about twice as large as the sumset. If N-1-2 = o(p(N)) then both the sum and difference sets almost surely have size (2N + 1) - O(p(N)-2), and so the ratio in question is almost surely very close to one. If p(N) = c &middot; N-1-2 then as c increases from zero to infinity (i.e., as the threshold is crossed), the same ratio almost surely decreases continuously from two to one according to an explicitly given function of c. We also extend our results to the comparison of the generalized difference sets attached to an arbitrary pair of binary linear forms. For certain pairs of forms f and g, we show that there in fact exists a sharp threshold at cf,g &middot; N-1-2, for some computable constant cf,g, such that one form almost surely dominates below the threshold and the other almost surely above it. The heart of our approach involves using different tools to obtain strong concentration of the sizes of the sum and difference sets about their mean values, for various ranges of the parameter p. &copy; 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009
Curve generation and modification based on radius of curvature smoothing
Authors: Tetsuzo Kuragano, Kazuhiro Kasono
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

A method to generate a quintic B-spline curve which passes through the given points is described. In this case, there are four more equations than there are control point positions. Therefore, four gradients which are the first derivative of a quintic B-spline equation are assigned to the given points. In addition to this method, another method to generate a quintic B-spline curve which passes through the given points, and which has the first derivative at these given points is described. In this case, a linear system will be underdetermined, determined or overdetermined depending on the number of given points with gradients. A method to modify a quintic B-spline curve shape according to the specified radius of curvature distribution to realize an aesthetically pleasing freeform curve is described. The differences between the B-spline curve radius of curvature and the specified radius of curvature is minimized by introducing the least-squares method.
E-cards and e-Health: an ethics point of view
Authors: Cristina Borzan, Liliana Rogozea, Carmen Domnariu, Florin Leasu, Mocean Floarea, Dana Minca
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

This paper present the role of ethics using the electronic data, specifically electronic card. According with the EU development of a solution for provide information on the patient's medical history, about his or her diseases, treatment made and of course about payment for private medical services. The security is very important and helps us to assure the confidentiality of the data, but, in the same time the accessibility for medical data.
Throughput versus routing overhead in large ad hoc networks
Authors: Radha Krishna Ganti, Martin Haenggi
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

Consider a wireless ad hoc network with n nodes distributed uniformly on [0, 1]2. The transport capacity (TC) of such a wireless network scales like &radic;n. To achieve this, each node should serve about &radic;n distinct information flows. So the routing table of each node should be of the order &radic;n bits. We show that if the size of the routing table is restricted to be of the order O(nH(&delta;)), the maximum achievable pernode TC is O(nR(&delta;)) when the source-destination distance is n-&delta;/2. We show that R(&delta;) = min {1/2, &delta;/2 + H(&delta;)} - 1 is the optimal tradeoff.
Semantic Wiki Search
Authors: Peter Haase, Daniel Herzig, Mark Musen, Thanh Tran
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

Semantic wikis extend wiki platforms with the ability to represent structured information in a machine-processable way. On top of the structured information in the wiki, novel ways to search, browse, and present the wiki content become possible. However, while powerful query languages offer new opportunities for semantic search, the syntax of formal query languages is not adequate for end users. In this work we present an approach to semantic search that combines the expressiveness and capabilities of structured queries with the simplicity of keyword interfaces and faceted search. Users articulate their information need in keywords, which are translated into structured, conjunctive queries. This translation may result in multiple possible interpretations of the information need, which can then be selected and further refined by the user via facets. We have implemented this approach to semantic search as an extension to Semantic MediaWiki. The results of a user study in the SMW-based community portal semanticweb.org show the efficiency and effectiveness of the approach as well as its ease of use.
Points surrounding the origin
Authors: Andreas F. Holmsen, J&#x00e1;nos Pach, Helge Tverberg
Venue: Combinatorica (2008)

Suppose d > 2, n > d+1, and we have a set P of n points in d-dimensional Euclidean space. Then P contains a subset Q of d points such that for any p &#x2208; P, the convex hull of Q&#x222a;{p} does not contain the origin in its interior. We also show that for non-empty, finite point sets A 1, ..., A d+1 in &#x211d; d , if the origin is contained in the convex hull of A i &#x222a; A j for all 1&#x2264;i<j&#x2264;d+1, then there is a simplex S containing the origin such that |S&#x2229;A i |=1 for every 1&#x2264;i&#x2264;d+1. This is a generalization of B&#x00e1;r&#x00e1;ny&#x2019;s colored Carath&#x00e9;odory theorem, and in a dual version, it gives a spherical version of Lov&#x00e1;sz&#x2019; colored Helly theorem.
A generalized Shapiro-Wilk W statistic for testing high-dimensional normality
Authors: Jiajuan Liang, Man-Lai Tang, Ping Shing Chan
Venue: Computational Statistics Data Analysis (2009)

Shapiro and Wilk's [Shapiro, S.S., Wilk, M.B., 1965. An analysis of variance test for normality (complete samples). Biometrika 52, 591-611] W-statistic was found to have competitive power performance in testing univariate normality. Generalizations of the W-statistic to the multivariate case have been proposed by many researchers. In this paper, we propose a family of generalized W-statistics for testing high-dimensional normality by using the theory of spherical distributions. The proposed statistics apply to the case that the sample size is smaller than the dimension. Monte Carlo studies demonstrate feasible performance of the proposed tests in controlling type I error rates and power against some non-normal data. It is concluded that the proposed statistics are superior to existing generalizedW-statistics and show competitive benefits in testing high-dimensional normality with small sample size.
Determination of the duals of classical sets of sequences of fuzzy numbers and related matrix transformations
Authors: Özer Talo, Feyzi Başar
Venue: Computers Mathematics with Applications (2009)

The convergence of a series of fuzzy sets was examined via Zadeh's Extension Principle by M. Stojakovic and Z. Stojakovic [M. Stojakovic, Z. Stojakovic, Addition and series of fuzzy sets, Fuzzy Sets and Systems 83 (1996), 341-346]. Since the utilization of this approach is quite difficult in practice, we prefer the idea of using the sum of the series of @l-level sets. The main purpose of the present paper is to determine the @a-, @b- and @c-duals of the classical sets of sequences of fuzzy numbers and is to give the necessary and sufficient conditions on an infinite matrix of fuzzy numbers transforming one of the classical sets to the another one.
Vivifying Propositional Clausal Formulae
Authors: Cédric Piette, Youssef Hamadi, Lakhdar Saïs
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the current pre-processing techniques, our approach aims at improving the filtering power of the original clauses while producing a small number of additional and relevant clauses. More precisely, an incomplete redundancy check is performed on each original clauses through unit propagation, leading to either a sub-clause or to a new relevant one generated by the clause learning scheme. This preprocessor is empirically compared to the best existing one in terms of size reduction and the ability to improve a state-of-the-art satisfiability solver.
Multiple Criteria Quadratic Programming for Financial Distress Prediction of the Listed Manufacturing Companies
Authors: Ying Wang, Peng Zhang, Guangli Nie, Yong Shi
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

Nowadays, how to effectively predict financial distress has become an important issue for companies, investors and many other user groups. The purpose of this paper is to apply the Multiple Criteria Quadratic Programming (MCQP) model to predict financial distress of the listed manufacturing companies. Firstly, we introduce the formulation of MCQP model. Then we use ten-folder cross validation to test the stability and accuracy of MCQP model on a real-life listed companies' financial ratios dataset. At last, we compare MCQP model with other two well-known models: Logistic Regression and SVM models. The experimental results show that MCQP is accurate and stable for predicting the financial distress of the listed manufacturing companies. Consequently, we can safely say that MCQP is capable of providing stable and credible results in predicting financial distress.
Learning decision tree for ranking
Authors: Liangxiao Jiang, Chaoqun Li, Zhihua Cai
Venue: Knowledge and Information Systems (2009)

Decision tree is one of the most effective and widely used methods for classification. However, many real-world applications require instances to be ranked by the probability of class membership. The area under the receiver operating characteristics curve, simply AUC, has been recently used as a measure for ranking performance of learning algorithms. In this paper, we present two novel class probability estimation algorithms to improve the ranking performance of decision tree. Instead of estimating the probability of class membership using simple voting at the leaf where the test instance falls into, our algorithms use similarity-weighted voting and naive Bayes. We design empirical experiments to verify that our new algorithms significantly outperform the recent decision tree ranking algorithm C4.4 in terms of AUC.
No Author-Based Selective Receipt in Certified Email with Tight Trust Requirements
Authors: Nicolás González-Deleito
Venue: Proceeding of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005 (2005)

Kremer and Markowitch introduced in [10] a new property for certified email protocols called no author-based selective receipt, and proposed two new protocols respecting it. In this paper we show that these protocols implicitly require the sender of the email to trust the trusted third party to assure this property. We propose a new protocol in which this trusted third party has only to be trusted to assure fairness and timeliness, like in most other exchange protocols. Unfortunately, unlike [10], our protocol does not guarantee the delivery of a non-repudiation of origin evidence to the recipient. We prove that this is impossible to achieve without a fully trusted third party.
A network mobility management scheme for fast QoS handover
Authors: Cheng-Wei Lee, Meng Chang Chen, Yeali S. Sun
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

The evolution of wireless access technologies has led to a new era of Mobile Internet. Network mobility, which considers the mobility of an entire network, is particularly suitable for mobile environments. Efficient network mobility QoS-handover design is essential to meet QoS requirements for real-time communication. In this paper, we propose a cross-layer hierarchical network mobility architecture and protocol, called HiMIP-NEMO, which is designed for all-IP networks. HiMIP-NEMO optimizes the routing between a mobile network node and the correspondent node, and supports fast QoS provisioning in the network mobility service domain. The simulation results demonstrate that Hi-MIP-NEMO reduces handover latency and packet loss, and supports high velocity vehicles.