ppxscal/embedding_network huggingface dataset:
Frame rate up-conversion using region-based optical flow
Authors: Thanakorn Sakchaicharoenkul
Venue: Machine Graphics Vision International Journal (2006)

Frame rate up-conversion is widely used for converting between the standards and increasing the frame rate of low bit rate compression video conferences. The raster-based animation tweening algorithm [8] can not be directly applied with frame rate up-conversion, because the crucial procedure of the algorithm, the mean shift-based image segmentation method, can not handle complex characteristics of a real world video image. In some case, the background and foreground may be merged into one segment. In this work, a synergistic image segmentation method is used according to the particular needs of a real world video image. The experimental results illustrate that higher quality in-between frames can be obtained by the proposed algorithm.
Social enjoyment with electronic photograph displays: Awareness and control
Authors: Siín E. Lindley, Andrew F. Monk
Venue: International Journal of Human-Computer Studies (2008)

Two experiments are reported in which groups of three friends socialised around their own photographs. The photographs were of two types, depicting events where all three had been present, permitting reminiscing, and events where only the photographer had been present, permitting storytelling. In Experiment 1 the seating arrangement was manipulated so that the two audience members sat either behind or around the photographer. It was hypothesised that the former would lower levels of peripheral awareness within the groups, resulting in a more formal conversation and a poorer recreational experience. In Experiment 2, control over the photographs was manipulated so that either all three group members had access to a remote control (distributed control), or only the photographer did (single control). It was hypothesised that distributed control would result in less formal conversations and a better recreational experience. In both experiments, the hypotheses were supported: patterns of social interaction were significantly affected by the manipulation of awareness during storytelling, and by the manipulation of control during reminiscing. Additionally, the two manipulations were found to affect ratings of enjoyment and fun, respectively. The results are interpreted in terms of a causative model of unfolding and recounted experience.
DDSP based modem technology
Authors: Davinder Pal Sharma, Jasvir Singh
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Technologies are changing very frequently in the field of data communication over twisted copper pair (plain old telephone lines). These changes are due to quick advancement in computer and digital communication technologies along with powerful digital signal processing algorithms. Of course increasing demand for higher speed is also the major force behind these advancements. Present paper deals with the brief technical review of old modem technologies being used for data communication over telephone lines as well as emerging 56kbps (V.90 and V.92) modem technologies for general purpose Internet use. The Core issues involved in V.90 and V.92 technologies are covered with greater detail. Various possible implementation techniques for these modem standards are suggested. Major emphasis is given on digital signal processing based soft implementation of this technology on Dedicated Digital Signal Processor (DDSP).
A Ontology-Based Multimedia Resource Sharing Framework in Multimedia Science Paper Generation
Authors: Junhua Zhu, Hao Chen, Beiji Zou, Haoyu Zhou
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The rapid increase of multimedia resources makes it difficult for organizing, describing and locating. The method based on ontology is one of the resolving directions, which can simplify resource organization and improve the resource searching efficiency. Based on ontology, we developed a Multimedia Science Paper Generation System (MSPGS). It implements an ontology-based multimedia resource sharing framework. In this paper, three key processes of multimedia resource sharing framework are introduced in detail. First, the ontology based multimedia resource organization structure is proposed; then, we introduce an approach for multimedia description; finally, in order to locate the target multimedia resource accurately and efficiently, the Concept Classified Semantic Search algorithm is described. To evaluate the efficiency and precision of the sharing framework, some widely used evaluation methods such as Precision, Recall and F-Measure are used in the experiments. The experimental results show that MSPGS can work well and the proposed multimedia resource sharing framework is effective.
Major Eclipse
Venue: Queue (2006)

As the Eclipse Foundation gears up to ship its most comprehensive set of open source application development tools to date, Mike Milinkovich, executive director of the Eclipse Foundation, explains why a best-of-breed approach based on an integrated set of open source tools ultimately will provide a better experience for developers. 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
The Principles of Beautiful Web Design, 1 edition
Authors: Jason Beaird
Venue:  (2007)

Tired of making web sites that work absolutely perfectly but just don't look nice? If so, then The Principles of Beautiful Web Design is for you. A simple, easy-to-follow guide, illustrated with plenty of full-color examples, this book will lead you through the process of creating great designs from start to finish. Good design principles are not rocket science, and using the information contained in this book will help you create stunning web sites. Understand the design process, from discovery to implementation Understand what makes "good design" Developing pleasing layouts using grids, the rule of thirds, balance and symmetry Use color effectively, develop color schemes and create a palette Use textures, lines, points, shapes, volumes and depth Learn how good typography can make ordinary designs look great Effective imagery: choosing, editing and placing images And much more Throughout the book, you'll follow an example design, from concept to completion, learning along the way.
Composing knowledge fragments: a next generation ide
Authors: Thomas Fritz
Venue: Companion of the 30th international conference on Software engineering (2008)

When building a software system, software developers each contribute a flow of information that together forms the system. As they work, programmers continuously consult various facts (knowledge) about this information to answer their questions about the system. The knowledge most easily accessed today in a programming environment involves facts about the structure of the program. However, the knowledge required by a programmer is broader than just structure; it also includes knowledge about design, requirements, and the development process, to name just a few other sources. To enable developers to access this knowledge more efficiently, our goal is to develop a model for programming environments that allows various fragments of different kinds of knowledge to be configured flexibly. This model would enable new presentations to show these knowledge fragments in ways that more directly answer programmers' questions.
A partition-based serial algorithm for generating viewshed on massive DEMs
Authors: Huanping Wu, Mao Pan, Lingqing Yao, Bing Luo
Venue: International Journal of Geographical Information Science (2007)

As increasingly large-scale and higher-resolution terrain data have become available, for example air-form and space-borne sensors, the volume of these datasets reveals scalability problems with existing GIS algorithms. To address this problem, a kind of serial algorithm was developed to generate viewshed on large grid-based digital elevation models (DEMs). We first divided the whole DEM into rectangular blocks in row and column directions (called block partitioning), then processed these blocks with four axes followed by four sectors sequentially. When processing the particular block, we adopted the 'reference plane' algorithm to calculate the visibility of the target point on the block, and adjusted the calculation sequence according to the different spatial relationships between the block and the viewpoint since the viewpoint is not always inside the DEM. By adopting the 'Reference Plane' algorithm and using a block partitioning method to segment and load the DEM dynamically, it is possible to generate viewshed efficiently in PC-based environments. Experiments showed that the divided block should be dynamically loaded whole into computer main memory when partitioning, and the suggested approach retains the accuracy of the reference plane algorithm and has near linear compute complexity.
TIGRA: Timely Sensor Data Collection Using Distributed Graph Coloring
Authors: Lilia Paradis, Qi Han
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

In this paper we present a protocol for sensor applicationsthat require periodic collection of raw data reportsfrom the entire network in a timely manner. We formulatethe problem as an NP-hard graph coloring problem. Wethen present TIGRA - a distributed heuristic for graph coloring that takes into account application semantics and special characteristics of sensor networks. TIGRA ensures that no interference occurs and spatial channel reuse is maximized by assigning a specific time slot for each node totransmit. Although the end-to-end delay incurred by sensordata collection largely depends on specific topology,platform, and application, TIGRA provides a transmissionschedule that guarantees near-optimal delay on sensor datacollection.
MERIS Full Resolution data for mapping level-of-damage caused by forest fires: the Valencia de Alcántara event in August 2003
Authors: F. González-Alonso, S. Merino-De-Miguel, A. Roldán-Zamarrón, S. García-Gigorro, J. M. Cuevas
Venue: International Journal of Remote Sensing (2007)

This paper concerns an estimation of burned area and fire severity levels in the area affected by the Valencia de Alcántara forest fire, an event that took place near the border between Portugal and Spain in August 2003. 'Level-of-damage' and 'fire severity' are both defined as the impact of fire on the vegetation. The study presented herein uses satellite information from Envisat-MERIS (Medium Resolution Imaging Spectrometer) and SPOT5-HRG (Système pour l'observation de la Terre-High Resolution Geometric instrument), ground data and ancillary maps. The methodology consisted of applying linear unmixing algorithms on a post-fire MERIS image, using a post-fire SPOT5-HRG image and ground data for endmember definition. Satellite-derived level-of-damage information is used for affected area estimation and for comparison with fire severity ground measurements. Satellite-derived level-of-damage is also compared with information from the Spanish National Forest Map (NFM) to assess to what extent fire severity is related to particular forest types. Results reached so far reveal that MERIS estimations on wildfire damage over forested areas may help in establishing degrees of affection, which is useful to plan forest restoration works.
Parallel global and local convergent algorithms for solving the iniverse additive singular value problem
Authors: Georgina Flores Becerra, Antonio M. Vidal Maciá
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

In this paper we propose two algorithms for solving the Inverse Additive Singular Value Problem (IASVP). The first one, denoted MI, solves the IASVP by formulating it like a nonlinear problem and using a Newton type method. MI is a local convergent algorithm. The second one, called LP, solves the IASVP by formulating it as a least squares problem and using a projection method; LP is a global convergent method. We present the sequential and parallel versions for each algorithm, and we show numerical experiments to illustrate their behaviour and good performance.
Short-Term Power Load Forecasting Using Improved Ant Colony Clustering
Authors: Wei Li, Zhu-Hua Han
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Ant colony algorithm (ACA), inspired by the foodsearching behavior of ants, is an evolutionary algorithm and performs well in discrete optimization. Ant colony algorithms have been recently suggested for short-term load forecasting (STLF) by a large number of researchers. In this paper, an Improved Ant Colony Clustering (IACC) based on Ant Colony Algorithm was put forward. In IACC, each load data was represented by an ant, making use of the parallel optimization characteristics of ant colony algorithm and the ability of volatile quotient method to adaptively change the amount of information, with improvements have been made by changing the pheromone concentration on every path and enhancing the heuristic function to accelerate the searching process. Experiments and comparisons are done to show that the IACC is an efficient and effective approach, not only IACC increased the STLF accuracy, but also IACC is more exquisite to the similarity of load curve profile. Key words: Power Load Forecasting, IACC, Colony Clustering, Load Curves
Articulation work in small-scale offshore software development projects
Authors: Alexander Boden, Bernhard Nett, Volker Wulf
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

The paper describes coordination practices of small and medium enterprises (SME) that outsourced parts of their software development to offshore vendors. Our case study in a German company shows that the geographic distribution of knowledge and expertise requires continuous informal coordination across the teams. Such practices can be described as a combination of formal coordination and informal articulation work in the sense of Anselm Strauss' theoretical framework. Both are closely interwoven and connected to the use of media such as coordination tools and instant messengers. We conclude that SME risk losing their core competencies when neglecting articulation work and hint at mismatches between scientific recommendations and actual development practices of SME.
Better reliability assessment of database based application software
Authors: M. S. Hosain, M. S. Alam
Venue: Proceedings of the 9th International Conference on Circuits (2005)

Software systems are becoming increasingly more complex and testing it to a reliable system requires a great deal of effort. Statistical testing promises a solution to this increased testing burden and gives the opportunity to have statistical inferences like reliability, mean time to failure etc. Today there are hundreds of reliability models with more models developed every year. Still there does not exist any model that can be applied in all cases. In this paper we present the feasibility of applying statistical testing based on Markov chain usage model to database based application software and show that statistical testing gives better reliability assessment than random testing.
Applying the community of practice approach to individual IT projects
Authors: Peter Strazdins
Venue: Proceedings of the tenth conference on Australasian computing education - Volume 78 (2008)

This paper reports a study of utilizing the action research educational method to the application and evaluation of the Community of Practice (CoP) principle to individual postgraduate project courses in IT at the Australian National University. Two CoPs were formed, comprising the students enrolled in research and implementation project courses and the project co-ordinator (the author) of the first semesters of 2006 and 2007. The 7 students in the 2006 CoP were predominantly local students, whereas the 10 in the 2007 CoP were almost all international students, having significantly different language and cultural backgrounds. The action research method was applied over two phases each semester, the first in weeks 1--7 (involving 5 meeting sessions), and the second in weeks 10--15 (involving 4 meeting sessions), and also between semesters. Data for evaluation includes student feedback (including an entry and exit survey, and anecdotal remarks), observation of the CoPs, and evaluation of student performance in relevant aspects of their project work. The results of the evaluation indicate that the CoP approach, combined with the action research method, was very effective in teaching research skills and significantly improved the students' project experience. There was consistent evidence of desirable group behavior emerging, including the establishment of a mutually supporting environment. Even through the projects were individual, the commonality of learning research skills and peer feedback was sufficient to establish a cohesive and effective community. A number of design principles and factors that are important to achieve positive results are identified. While this was a limited trial of the approach, we feel that it is promising to apply to technical student projects in other areas, and it is a valuable approach in supporting research-based education.
Using networking examples for labs and enrichment in CS1
Authors: Thomas P. Murtagh
Venue: Journal of Computing Sciences in Colleges (2008)

John Gage's maxim, "The network is the computer," is self-evident to our students. IM, email, Facebook, YouTube, etc. are all network applications. Labs involving network applications can therefore be very motivating. This workshop will provide participants with 1) techniques for making networking projects accessible to CS1 students without sacrificing time required to cover fundamental skills, 2) an understanding of protocols such as IMAP and AOL's instant messaging protocol sufficient to design network-based laboratories, 3) examples of specific labs that have been successfully used in a Java-based CS1, and 4) strategies for enriching CS1 by exploring networking technology.
Span-program-based quantum algorithm for evaluating formulas
Authors: Ben W. Reichardt, Robert Spalek
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We give a quantum algorithm for evaluating formulas over an extended gate set, including all two- and three-bit binary gates (e.g., NAND, 3-majority). The algorithm is optimal on read-once formulas for which each gate's inputs are balanced in a certain sense. The main new tool is a correspondence between a classical linear-algebraic model of computation, "span programs," and weighted bipartite graphs. A span program's evaluation corresponds to an eigenvalue-zero eigenvector of the associated graph. A quantum computer can therefore evaluate the span program by applying spectral estimation to the graph. For example, the classical complexity of evaluating the balanced ternary majority formula is unknown, and the natural generalization of randomized alpha-beta pruning is known to be suboptimal. In contrast, our algorithm generalizes the optimal quantum AND-OR formula evaluation algorithm and is optimal for evaluating the balanced ternary majority formula.
Minimizing quadratic functions with separable quadratic constraints
Authors: R. Kucera
Venue: Optimization Methods Software (2007)

This article deals with minimizing quadratic functions with a special form of quadratic constraints that arise in 3D contact problems of linear elasticity with isotropic friction [Haslinger, J., Kucera, R. and Dostál, Z., 2004, An algorithm for the numerical realization of 3D contact problems with Coulomb friction. Journal of Computational and Applied Mathematics, 164/165, 387-408.]. The proposed algorithm combines the active set method with the conjugate gradient method. Its general scheme is similar to the algorithms of Polyak's type that solve the quadratic programming problems with simple bounds. As the algorithm does not terminate in a finite number of steps, the convergence is proved. The implementation uses an adaptive precision control of the conjugate gradient loops. Numerical experiments demonstrate the computational efficiency of the method.
An anisotropic, superconvergent nonconforming plate finite element
Authors: Shaochun Chen, Li Yin, Shipeng Mao
Venue: Journal of Computational and Applied Mathematics (2008)

The classical finite element convergence analysis relies on the following regularity condition: there exists a constant c independent of the element K and the mesh such that h"K/@r"K=
The Spicy system: towards a notion of mapping quality
Authors: Angela Bonifati, Giansalvatore Mecca, Alessandro Pappalardo, Salvatore Raunich, Gianvito Summa
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

We introduce the Spicy system, a novel approach to the problem of automatically selecting the best mappings among two data sources. Known schema mapping algorithms rely on value correspondences -- i.e. correspondences among semantically related attributes -- to produce complex transformations among data sources. Spicy brings together schema matching and mapping generation tools to further automate this process. A key observation, here, is that the quality of the mappings is strongly influenced by the quality of the input correspondences. To address this problem, Spicy adopts a three-layer architecture, in which a schema matching module is used to provide input to a mapping generation module. Then, a third module, the mapping verification module, is used to check candidate mappings and choose the ones that represent better transformations of the source into the target. At the core of the system stands a new technique for comparing the structure and actual content of trees, called structural analysis. Experimental results show that our mapping discovery algorithm achieves both good scalability and high precision in mapping selection.
Numerical method for a class of singular non-linear boundary value problems using Green's functions
Authors: Zhongdi Cen
Venue: International Journal of Computer Mathematics (2007)

A numerical method based on Green's function is presented for solving a class of singular non-linear boundary value problems. By applying Green's function an equivalent integral equation, which can be solved by linear interpolation on a non-uniform mesh, can be derived from the singular non-linear boundary value problem. This equation is shown to be second-order convergent. The numerical method can be extended to more general singular boundary value problems. Numerical experiments support these theoretical results and indicate that the estimates are sharp.
An Evaluation of QoS Management Approaches in Real-Time Databases
Authors: Salwa M'barek, Leila Baccouche, Henda Ben Ghezala
Venue: Proceedings of the Third International Conference on Systems (2008)

In this paper we propose an evaluation model of QoS (Quality of Service) management approaches in real time database management systems (RTDBMS). In our model we define three evaluation levels: Models, Parameters and Policies. Each level is composed by a set of evaluation criteria. Our model is illustrated by an evaluation study of principale existing approaches of QoS management in RTDBMS. We aim to help designers of real time database management systems to choose the most appropriate QoS management approach corresponding to their real time application requirements.