ppxscal/embedding_network huggingface dataset:
Adobe Fireworks Web Design Interview Questions: Web Design Certification
Authors: Terry,  Sanchez-Clark
Venue:  (2007)

Book Description: The Ultimate Reference & Learning Guide for Web Designers and Administrators! Macromedia Fireworks is an essential tool for today's web designer, particularly those already required to work with other macromedia products such as the popular Dreamweaver and Flash. This comprehensive guidebook will help you evaluate potential candidates for a job, assess your skills, and guide you through the learning process. You'll be exposed to in-depth sections that go over the crucial information as well as special features of Fireworks that will set you apart from other developers. More than just a rehash of Adobe's documentation and sales pitches, each section is based on knowledge and experience gained from successful, high-profile Adobe Fireworks users. Key topics include: Bitmap and vector graphics editing. Integration with Dreamweaver, Flash, and other popular products. Slices and ability to ad hotspots. Overview of all toolbar and menu features. Troubleshooting and maintenance.
Extending the lifetime of media recorders constrained by battery and flash memory size
Authors: Younghyun Kim, Youngjin Cho, Naehyuck Chang, Chaitali Chakrabarti, Nam Ik Cho
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

The lifetime of a stand-alone media recorder is a function of both the battery size and flash memory size. In this paper, we present a power management framework for media recorders that significantly enhances their lifetime while minimizing the flash memory usage and maintaining the same level of recording quality. This is achieved by implementing a mixture of encoding algorithms of different complexities that generate data with different compression ratios, and in turn balancing the energy consumption and the flash memory usage. The proposed method can be effectively employed on a direct battery drive system which does not use a DC-DC converter. The gradual drop of the battery voltage of such system is compensated by operating algorithms of lower complexity more and more. For a speech encoding application where a mixture of ADPCM (low complexity) and MP3 (high complexity) is used, the proposed algorithm achieves 70% more lifetime than a DC-DC converter with a highest clock frequency, and 20% more lifetime than even a DC-DC converter with the optimal clock frequency.
NEAT-o-Games: blending physical activity and fun in the daily routine
Authors: Yuichi Fujiki, Konstantinos Kazakos, Colin Puri, Pradeep Buddharaju, Ioannis Pavlidis, James Levine
Venue: Computers in Entertainment (CIE) (2008)

This article describes research that aims to encourage physical activity through a novel pervasive gaming paradigm. Data from a wearable accelerometer are logged wirelessly to a cell phone and control the animation of an avatar that represents the player in a virtual race game with other players over the cellular network. Winners are declared every day and players with an excess of activity points can spend some to get hints in mental games of the suite, like Sudoku. The racing game runs in the background throughout the day and every little move counts. As the gaming platform is embedded in the daily routine of players, it may act as a strong behavioral modifier and increase everyday physical activity other than volitional sporting exercise. Such physical activity (e.g., taking the stairs), is termed NEAT and was shown to play a major role in obesity prevention and intervention. A pilot experiment demonstrates that players are engaged in NEAT-o-Games and become more physically active while having a good dosage of fun.
Computer science: past, present, and future
Authors: Ed Lazowska
Venue: ACM SIGCSE Bulletin (2008)

Computing research has made remarkable advances, but there's much more to be accomplished. The next few decades of advances should be even more significant, and even more interesting, than the past few. The National Science Foundation has created the Computing Community Consortium to engage computing researchers in an ongoing process of visioning - of imagining what we might contribute to the world, in terms that we and the world might both appreciate. This process is just beginning, and I'd like to take this opportunity to engage you. I will review the progress that our field has made, and I'll present a number of "grand challenge" problems that we should be prepared to tackle in the coming decade. I'll invite your contributions.
A Security Model and its Application to a Distributed Decision Support System for Healthcare
Authors: Liang Xiao, Javier Vicente, Carlos Sáez, Andrew Peet, Alex Gibb, Paul Lewis, Srinandan Dasmahapatra, Madalina Croitoru, Horacio González-Vélez, Magí Lluch i. Ariet, David Dupplaw
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

A distributed decision support system involving multiple clinical centres is crucial to the diagnosis of rare diseases. Although sharing of valid diagnosed cases can facilitate later decision making, possibly from geographically different centres, the released information could reveal patient privacy if it is not properly protected. Clinical centres may have to impose their distinct regulations and rules that govern the use of their data externally. The collaboration of centres, therefore, must respect the collective policies and ideally, serve users the most appropriate and useful resources possible in the system according to the past experience. In this way, the system’s value is entrusted and even elevated through continuous collaboration. We present in this paper a link-anonymised data scheme and in addition to that, a security model that together enforce privacy data security and secure resource access for distributed clinical centres. Our illustration of the approach involves a prototype medical decision support system, HealthAgents, for brain tumour diagnosis.
Speech Acts, Epistemic Planning and Grice's Maxims
Authors: Allan Ramsay, Debora Field
Venue: Journal of Logic and Computation (2008)

Work on speech acts has generally involved the introduction of sets of different actions such as informing, reminding, bluffing and lying. These actions have different preconditions and effects, and hence can be used to achieve a wide variety of different real-world goals. The problem is that they tend to have indistinguishable surface forms. As such, it is extremely difficult for the hearer to decide which action she thinks has been performed, and it is therefore also extremely difficult for the speaker to be confident about how the hearer will respond. We will show how to achieve complex goals on the basis of a very simple set of linguistic actions. These actions have clearly marked surface forms, and hence can easily be distinguishable by a hearer. In order to do this, we have developed an epistemic planner with a number of interesting features, and with a number of optimisations that relate directly to aspects of the task at hand.
A stochastic multipath propagation channel model for mobile environments
Authors: Seedahmed S. Mahmoud, Zahir M. Hussain, Peter O'Shea
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

In this paper we present a stochastic space-time geometrical-based channel model for a macro-cell mobile environment. We consider reverse link with a uniform linear array (ULA) antenna. This model combines scalar stochastic fading model (for local scatterers) with the geometrical hyperbolic model (for dominant reflectors). We assume one resolvable path for each dominant reflector. We take into consideration the movement of the mobile, which may cause temporal fluctuations in the channel impulse response as well as appearance (disappearance) of multipath components. The proposed model provides statistics of the direction-of-arrival (DOA), fading amplitude, time-of-arrival (TOA), and phase data for wireless communication channels. The model is also useful for analyzing the performance of wireless communication systems and space-time systems (i. e., with smart antennas).
Deverbal Nouns in Knowledge Representation
Authors: Olga Gurevich, Richard Crouch, Tracy Holloway King, Valeria de Paiva
Venue: Journal of Logic and Computation (2008)

Deverbal nouns pose serious challenges for knowledge-representation systems. We present a method of canonicalizing deverbal noun representations, relying on a rich lexicon of verb subcategorization frames, the WordNet database, a large finite-state network for derivational morphology and a series of heuristics for mapping deverbal arguments onto the arguments of corresponding verbs.1
Hierarchical Bayesian approach for ranking of accident blackspots with reference to cost of accidents
Authors: Noorizam Daud, Kamarulzaman Ibrahim, Kamaruzzman Sopian
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

Road accident is an unfortunate event which is a matter of serious concern to the authority. A proactive measure taken in reducing the rate of accidents is to identify hazardous locations for treatment. In order to allocate resources wisely when treating accident locations, engineers usually rank accident locations based on the mean number of accidents observed over a period of time. Identification, ranking and selecting hazardous accident locations from a group under consideration is a fundamental goal for traffic safety researchers. The search of a better method to carry out such tasks is the main aim of this study in order to improve road safety in the country. The number of accident varies within and between locations, hence making Bayesian hierarchical model suitable to be applied when allowing for these two stages of variation. This study will illustrates the use of posterior mean to rank accident blackspots.
A dining philosophers algorithm with polynomial response time
Authors: B. Awerbuch
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Presents an efficient distributed online algorithm for scheduling jobs that are created dynamically, subject to resource constraints that require that certain pairs of jobs not run concurrently. The focus is on the response time of the system to each job, i.e. the length of the time interval that starts when the job is created or assigned to a processor and ends at the instant the execution of the job begins. The goal is to provide guarantees on the response time to each job j in terms of the density of arrivals of jobs that conflict with j. The model is completely asynchronous and includes various resource allocation problems that have been studied extensively, including the dining philosophers problem and its generalizations to arbitrary networks. In these versions of the problem, the resource requirements of each new job j determines an upper bound delta /sub j/ on the number of jobs that can exist concurrently in the system and conflict with j. Given such upper bounds, no scheduling algorithm can guarantee a response time better than delta /sub j/ times the maximum execution or message transmission time. A simple algorithm that guarantees response time that is essentially polynomial in delta /sub j/ is presented. It is based on the notion of a distribution queue and has a compact implementation.
A Design on Collaborative-Cooperative Document Edit System Based on Cognitive Analyses
Authors: Takayuki Fujimoto, Muhammad Dzulqarnain Muhammad Nasir, Tokuro Matsuo
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In this paper, we propose an interactive web-based multi-user document editing system in which users can cooperatively create and edit documents. Although the document description/edit system using a computer exists variously, those many are not reflecting human's cognitive mechanism. The design concept of our system is to reflect the cognitive mechanism of "We write sentences with the computer". Moreover, in this system, users can not only create and store valuable information, but are also able to collaborate in real-time with other users using our system. Additionally, information stored by past users can be reused in new documents if found relevant. This is known as indirect knowledge communication and collaboration.
Topological-Like Features in Diagrammatical Quantum Circuits
Authors: Yong Zhang, Louis H. Kauffman
Venue: Quantum Information Processing (2008)

In this paper, we revisit topological-like features in the extended Temperley---Lieb diagrammatical representation for quantum circuits including the teleportation, dense coding and entanglement swapping. We describe these quantum circuits and derive characteristic equations for them with the help of topological-like operations. Furthermore, we comment on known diagrammatical approaches to quantum information phenomena from the perspectives of both tensor categories and topological quantum field theories. Moreover, we remark on the proposal for categorical quantum physics and information as described by dagger ribbon categories.
Improved convergence and complexity analysis of Newton's method for solving equations
Authors: Ioannis K. Argyros
Venue: International Journal of Computer Mathematics (2007)

A finer optimal convergence condition for the local convergence of Newton's method is obtained using more precise error estimates. A condition for finer computational complexity is also obtained.
(n,e)-Graphs with maximum sum of squares of degrees*
Authors: Uri N. Peled, Rossella Petreschi, Andrea Sterbini
Venue: Journal of Graph Theory (1999)

Among all simple graphs on n vertices and e edges, which ones have the largest sum of squares of the vertex degrees? It is easy to see that they must be threshold graphs, but not every threshold graph is optimal in this sense. Boesch et al. [Boesch et al., Tech Rep, Stevens Inst Tech, Hoboken NJ, 1990] showed that for given n and e there exists exactly one graph of the form G1(p,q,r) = Kp + (Sq &cup; K1,r) and exactly one G2(p,q,r) = $S_{p} \cup (K_{q} + \overline{K_{1,r}})$ and that one of them is optimal, where K and S indicate complete and edgeless graphs, K1,r indicates a star on r + 1 vertices, &cup; indicates disjoint union, and + indicates complete disjoint join. We specify a general threshold graph in the form G *1 (a,b,c,d, &hellip;) = Ka + (Sb &cup; (Kc + (Sd &cup; &middot;&middot;&middot;))) or its complement G *2(a,b,c,d, &hellip;), and we prove that every optimal graph has the form G *1(a,b,c,d) or G *2(a,b,c,d) with b &le; 1 or c &le; 1 or d &le; 1. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 31: 283295, 1999 *Part of this research was conducted while the first author was visiting the University of Rome "La Sapienza" and the &Eacute;cole Polytechnique F&eacute;d&eacute;rale de Lausanne, whose support is gratefully acknowledged.
Research on Software Dependability Testing Profile in Internet Environment
Authors: Changjie Ma, Jing Zhao, Guochang Gu, Xiaoyun Ma
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

In Internet environment, software needs to be tested sufficiently before it is considered dependable. The operational profile based testing is an efficient way for both the reliability testing and the security testing. In practice, the two kinds of testing are often carried out separately to validate the dependability of the software, but it is resources consuming to develop the operational profile and security intrusion profile. In this paper, the feasibilities and the benefits of the idea of taking the dependability testing are given. Since the testing profile is often different from the operational profile with the influence of the security testing, a description method of the testing profile is needed. A brief analysis of the description of operational profile is made, and on the base of the extended operational profile, the method to describe the dependability testing profile is proposed.
Foundation Flash CS3 Video (Foundation)
Authors: Tom Green, Adam Thomas
Venue:  (2008)

Video is one of the most exciting features on today's Internet, with widespread adoption being made possible by advances in bandwidth and software. But simply streaming video clips to Web users is only the tip of the iceberg! Flash CS3 offers a whole host of advanced video features, allowing you to create breathtaking user experiences. And this book, the 2nd edition of the critically-acclaimed Foundation Flash 8 Video, shows you how to make the most of video in Flash CS3. The authors start with the basics of creating video ready for use on the web using popular applications such as Windows Movie Maker and iMovie, creating FLV (Flash video) using both Flash and other applications such as Sorenson Squeeze, and importing that video into Flash. With that out the way, then turn their attention to essential practical techniques such as creating and customizing video players, applying blends and filters to Flash Video, effective use of video alpha channel and masks, captioning, cue points, interactivity using the Camera object, going full screen, and much more. This edition is fully-updated for Flash CS3 and ActionScript 3.0, and includes many new examples. Learn how to create video for the web using popular applications such as iMovie and Movie Maker, and turn it into Flash Video using Flash, and other tools such as Sorenson Squeeze Learn several essential practical techniques for manipulating video in Flash New edition fully-updated for Flash CS3 and ActionScript 3.0, with new examples What you'll learn All the essential video features of Flash CS3 and ActionScript 3.0 How to create video using iMovie and Windows Movie Maker How to process that video into Flash Video (FLV) using Flash, Sorenson Squeeze, and Flix Pro How to create a video player and customize it How to apply fantastic filters and blend modes to your video How to use masks with video How to create applications with multiple videos How to allow the user to interact with your Flash using the camera object How to add captions to your video How to work will full screen video A whole host of tips and special effects Who is this book for? This book is for anyone who wants to learn Flash video from the ground up. Summary of Contents Chapter 1 Creating and Playing Flash Video Chapter 2 Editing Video for Flash Chapter 3 Alternative FLV-Creation Tools Chapter 4 Creating a Custom Player Chapter 5 "Talking Head" Video and Alpha Channels Chapter 6 Adding Filters and Blend Effects to Flash Video Chapter 7 Masking Video Chapter 8 Flash Video Tricks, Tips, and Special Effects Chapter 9 Playing with Multiple Videos Chapter 10 The Camera Object and Flash Video Chapter 11 Cue Points and Captions in Flash Video Chapter 12 Going Small and Going Big with Flash Video
Distributed databases and peer-to-peer databases: past and present
Authors: Angela Bonifati, Panos K. Chrysanthis, Aris M. Ouksel, Kai-Uwe Sattler
Venue: ACM SIGMOD Record (2008)

The need for large-scale data sharing between autonomous and possibly heterogeneous decentralized systems on the Web gave rise to the concept of P2P database systems. Decentralized databases are, however, not new. Whereas a definition for a P2P database system can be readily provided, a comparison with the more established decentralized models, commonly referred to as distributed, federated and multi-databases, is more likely to provide a better insight to this new P2P data management technology. Thus, in the paper, by distinguishing between db-centric and P2P-centric features, we examine features common to these database systems as well as other ad-hoc features that solely characterize P2P databases. We also provide a non-exhaustive taxonomy of the most prominent research efforts toward the realization of full-fledged P2P databases.
A fedora librarian interface
Authors: David Bainbridge, Ian H. Witten
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

The Fedora content management system embodies a powerful and flexible digital object model. This paper describes a new open-source software front-end that enables end-user librarians to transfer documents and metadata in a variety of formats into a Fedora repository. The main graphical facility that Fedora itself provides for this task operates on one document at a time and is not librarian-friendly. A batch driven alternative is possible, but requires documents to be converted beforehand into the XML format used by the repository, necessitating a need for programming skills. In contrast, our new scheme allows arbitrary collections of documents residing on the user's computer (or the web at large) to be ingested into a Fedora repository in one operation, without a need for programming expertise. Provision is also made for editing existing documents and metadata, and adding new ones. The documents can be in a wide variety of different formats, and the user interface is suitable for practicing librarians. The design capitalizes on our experience in building the Greenstone librarian interface and participating in dozens of workshops with librarians worldwide.
Detecting synonyms in social tagging systems to improve content retrieval
Authors: Maarten Clements, Arjen P. de Vries, Marcel J.T. Reinders
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Collaborative tagging used in online social content systems is naturally characterized by many synonyms, causing low precision retrieval. We propose a mechanism based on user preference profiles to identify synonyms that can be used to retrieve more relevant documents by expanding the user's query. Using a popular online book catalog we discuss the effectiveness of our method over usual similarity based expansion methods.
An accurate and versatile lattice closure scheme for lattice Boltzmann equation fluids under external forces
Authors: A. P. Hollis, I. Halliday, C. M. Care
Venue: Journal of Computational Physics (2008)

We derive and demonstrate a practical, analytic, versatile and accurate algorithm designed to impose Dirichlet boundary conditions (specified boundary velocity) on the edge nodes of a lattice Boltzmann fluid simulation space, valid for situations in which the fluid at the boundary is subject to a force. The current algorithm models the lattice fluid on boundary and bulk nodes to the same accuracy and in a demonstrably equivalent manner. Whilst the new method presented here applies to rectangular geometries, it adds to our previous method [I. Halliday, L.A. Hammond, C.M. Care, A. Stevens, J. Phys. A: Math. Gen. 35 (2002) 157]: (i) the condition of mass-conservation, (ii) the ability to subject boundary fluid to a force and (iii) the ability to treat a range of complicated geometries with unimpaired accuracy.
Constructions of partitioned difference families
Authors: Jianxing Yin, Xiuling Shan, Zihong Tian
Venue: European Journal of Combinatorics (2008)

Partitioned difference families (PDFs) arise from constructions of optimum constant composition codes. In this paper, a number of infinite classes of PDFs are constructed, based on known cyclotomic difference families in GF(q). A general approach which obtains PDFs from difference packings and coverings in abelian group is also presented.