ppxscal/embedding_network huggingface dataset:
Effectiveness of Video Segmentation Techniques for Different Categories of Videos
Authors: Kazimierz Choroś, Michał Gonet
Venue: Proceeding of the 2008 conference on New Trends in Multimedia and Network Information Systems (2008)

Visual retrieval systems as well as Internet search engines demand efficient techniques of indexing to facilitate fast access to the required video or to the required video sequences in the video databases. Digital video databases are more and more frequently implemented not only in the Internet network but also in local networks and even in local personal computers. Different approaches to digital video indexing are applied: textual approach, extraction and representation of technical or structural features, content-based analysis, and finally segmentation. The segmentation process leads to the partition of a given video into a set of meaningful and individually manageable segments, which then can serve as basic units for indexing. Video has temporal properties such as camera motion, object movements on the scene, sequential composition, and interframe relationships. An effective segmentation technique is able to detect not only abrupt changes but also gradual scene changes, such as fade and dissolve transitions. The nature of movies, mainly the style of video editing has an influence on the effectiveness of temporal segmentation methods. The effectiveness of four methods was analyzed for five different categories of movie: TV talk-show, documentary movie, animal video, action & adventure, and pop music video. The cuts have been recognized as well as cross dissolve effects. The tests have shown that the specific nature of videos has an important influence on the effectiveness of temporal segmentation methods.
Nearest neighbors in high-dimensional data: the emergence and influence of hubs
Authors: Miloš Radovanović, Alexandros Nanopoulos, Mirjana Ivanović
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

High dimensionality can pose severe difficulties, widely recognized as different aspects of the curse of dimensionality. In this paper we study a new aspect of the curse pertaining to the distribution of k-occurrences, i.e., the number of times a point appears among the k nearest neighbors of other points in a data set. We show that, as dimensionality increases, this distribution becomes considerably skewed and hub points emerge (points with very high k-occurrences). We examine the origin of this phenomenon, showing that it is an inherent property of high-dimensional vector space, and explore its influence on applications based on measuring distances in vector spaces, notably classification, clustering, and information retrieval.
Suspicion of Hidden Agenda in Persuasive Argument
Authors: Paul E. Dunne
Venue: Proceeding of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006 (2006)

The process of argument may be aimed at persuading an agent to perform a particular act which its proposer views as advantageous to their own interests. The proponent's primary motivation for desiring a given action to be executed may, however, differ radically from those advertised reasons given as justification: in particular, an agent may wish to hide the true purpose of proposing an action, since knowledge of such motives would be very likely to result in it not being performed. This scenario has been described as the proponent agent having a “hidden agenda”, and is a widely-recognised phenomenon in persuasive argument settings such as electioneering. The purpose of this paper is to consider various issues arising when an agent seeks to assess a case for action presented to it as motivated by a potentially damaging hidden agenda.
On the relations between B2V Ms and Runge-Kutta collocation methods
Authors: L. Aceto, C. Magherini
Venue: Journal of Computational and Applied Mathematics (2009)

The principal aim of this paper is a rigorous analysis of the relations between Block Boundary Value Methods (B"2V Ms) with minimal blocksize defined over a suitable nonuniform finer mesh and well-known Runge-Kutta collocation methods. Moreover, a further aspect that will be briefly investigated is the construction of an extended finer mesh for building B"2V Ms with nonminimal blocksize. Some advantages that may arise from the use of the so-obtained methods will be also discussed.
A utility model for negotiation between semantic web services
Authors: Sandeep Kumar, Nikos E. Mastorakis
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

Using the utility-theory for the decision-making process during the negotiation between semantic web services is an appealing one. This paper proposes a computational model for the calculation of utilities of the negotiating semantic web services. The proposed model uses multiple attribute in the utility function and uses the basic values of these attributes such as values for offered price, quality and others. The model is based on a novel understanding that a service requester should remain indifferent to the changes in price or other such values if the corresponding quality has also been changed accordingly. A prototype system has been implemented in support of the proposed model. The work has been evaluated and the betterment has been reported.
Sentiment vector space model for lyric-based song sentiment classification
Authors: Yunqing Xia, Linlin Wang, Kam-Fai Wong, Mingxing Xu
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

Lyric-based song sentiment classification seeks to assign songs appropriate sentiment labels such as light-hearted and heavy-hearted. Four problems render vector space model (VSM)-based text classification approach ineffective: 1) Many words within song lyrics actually contribute little to sentiment; 2) Nouns and verbs used to express sentiment are ambiguous; 3) Negations and modifiers around the sentiment keywords make particular contributions to sentiment; 4) Song lyric is usually very short. To address these problems, the sentiment vector space model (s-VSM) is proposed to represent song lyric document. The preliminary experiments prove that the s-VSM model outperforms the VSM model in the lyric-based song sentiment classification task.
Achieving better coordination through revenue sharing and bargaining in a two-stage supply chain
Authors: Jing Hou, Amy Z. Zeng, Lindu Zhao
Venue: Computers and Industrial Engineering (2009)

Coordination is essential for improving supply chain wide performance. In this paper, we focus on a two-stage supply chain consisting of one supplier and one retailer, and in the chain, the retailer's profit is sensitive to the supplier's lead time, which is influenced by the supplier's target inventory level. The coordination between the two parties is achieved through revenue sharing and bargaining in such a way that their respective profit is better than that resulted from a decentralized optimization. The key contract parameter, the revenue-sharing fraction, along with the maximum amount of monetary bargain space, is obtained under explicit and implicit information, respectively. Numerical illustrations of the contracts for various scenarios are also given.
WriteOn1.0: a tablet PC-based tool for effective classroom instruction
Authors: Samantha Chandrasekar, Joseph G. Tront, Jane C. Prey
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

A Tablet PC combines all the features of a regular laptop computer with a digitizing screen that interacts with a complementary electronic pen stylus. The ability to annotate on a lecture presentation using the pen stylus of the Tablet PC has attracted the attention of academics to use them as a potential tool for effective classroom instruction. Tablet PC based educational software like Classroom Presenter allows the instructor to supplement lecture material comprising of static text-based PowerPoint® slides by directly annotating on them. However, computer science and engineering classes often involve the use of non text-based lecture material like a simulation demo over which a lecturer would like to make annotations. In order to facilitate this, we present a Tablet PC-based educational tool called WriteOn1.0, the second core implementation of the WriteOn tool, developed at Virginia Tech. WriteOn allows the instructor to utilize electronic ink to annotate on top of any application window visible on the Tablet PC screen, including those that play active content like a movie or simulation, by activating its virtual transparency surface called the eVellum (electronic vellum).The ability of WriteOn to improve classroom presentation were pedagogically very useful as shown by initial classroom testing. However, in order to deploy WriteOn on large scale in classrooms as an active and effective teaching tool of choice, some aspects of the application like its operational CPU performance and the GUI called for improvement. WriteOn1.0 addresses the drawbacks of WriteOn with the introduction of features such as the dynamic eVellum, a picture-based GUI and an improvement to the operational CPU performance of the screen capture process. In this paper, we shall present how WriteOn1.0 can potentially aid in effective lecturing, especially for subject matter like programming and digital circuit design, both of which involve the use of dynamic presentation material.
Distributed Systems and Their Environments
Authors: Matthew Hennessy
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

Process description languages, such as the picalculus [SW01], offer the possibility of formally describing system behaviour at varying levels of abstraction, and applying logical techniques to verify this behaviour.But system behaviour often depends on environmental considerations. What a system can do depends on the current context in which it finds itself. It is this context which determines what information is available to the system, and therefore affects its future evolution. In a dual manner the current context determines the knowledge of the system which is available to its environment, and thus affects the use which can be made of the system. Moreover this interplay between a system and its environment is dynamic, changing as either or both evolve.In this talk I will offer a survey of recent work on behavioural theories of systems in which their environments play a crucial role. We will see three instances in which environmental knowledge involves key features of distributed systems. Access control: Capabilities on resources and access rights to sites are determined by a static type system, [HRY05]; only partial knowledge of these types are available to the environment. Network failure: Systems run on a dynamically changing network of inter-connected nodes, where both the nodes and the connections are subject to failure, [FH08]; this network is shared between the system and its environment. Resource cost: Use of resources entail a cost, which must be borne by the processes responsible, [HG08]; the environment determines the overall funds available to processes for access to resources. The focus will be on a particular process description language called Dpi [Hen07], oriented towards distributed systems.
Practical horizon plane for low earth orbiting (LEO) satellite ground stations
Authors: Shkelzen Cakaj, Michael Fischer, Arpad L. Scholtz
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

Communication via satellite begins when the satellite is positioned in the desired orbital position. Ground stations can communicate with LEO (Low Earth Orbiting) satellites only when the satellite is in their visibility region. The duration of the visibility and so the communication duration varies for each satellite pass at the ground station, specifically for LEO satellites which do move too fast over the Earth [1]. For low cost LEO satellite ground stations in urban environment it will be a big challenge to ensure communication down to the horizon. The communication at low elevation angles can be hindered through natural barriers. Thus, motion (appearance) detection of the satellite above natural barriers enables the practical horizon to be determined. Practical horizon differs from the ideal horizon. This paper discusses the satellites motion detection and the difference in between ideal and practical horizon. For this paper, data recorded at the Vienna satellite ground station within the Canadian space observation project "MOST" (Micro variability and Oscillations of Stars) are applied. Vienna ground station system was set up at the Institute for Astronomy of the University of Vienna in cooperation with the Institute of Communications and Radio- Frequency Engineering of the University of Technology.
Agent-Based Modeling: The Santa Fe Institute Artificial Stock Market Model Revisited, 1st edition
Authors: Norman Ehrentreich
Venue:  (2007)

This book reconciles the existence of technical trading with the Efficient Market Hypothesis. By analyzing a well-known agent-based model, the Santa Fe Institute Artificial Stock Market (SFI-ASM), it finds that when selective forces are weak, financial evolution cannot guarantee that only the fittest trading rules will survive.Its main contribution lies in the application of standard results from population genetics which have widely been neglected in the agent-based community. This has led to various misinterpretations of previous simulation results. The book is able to finally establish the emergence of technical trading for faster learning speeds in the SFI-ASM beyond a doubt. In emphasizing the importance of genetic drift as an important evolutionary factor and analyzing its effects on various mutation operators, this book provides agent-based modelers with several tools to design better evolutionary algorithms. 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
Improving cache global consistency and hit ratio in dependency objects with semantic spatial locality correlations
Authors: Ching-Shun Hsieh, Jui-Wen Hung
Venue: WSEAS Transactions on Information Science and Applications (2009)

On requesting cache data in disk, the distribution of spatial locality is critical to access performance. Unfortunately, spatial locality properties of cached data is largely ignored, and only temporal locality is considered. Besides, an individual disk object might induce different dependency relations in different applications and possibly partial dependency to several distributed original data source (ODS). This interesting property might be neglected. Normally, these situations can be improved by effectiveness of storage caching, prefetching, and prediction of the user navigation behavior, data layout of storage systems and global consistency storage replicas. In this paper, we consider the problem and solve it using data mining techniques and a service routable consistency framework (Global Distributed Hierarchical Cache Consistent Model; GDHCCM). The model based on a scalable routing service algorithm that dynamic reconfiguration forwarding data path within hierarchical enterprise region portals. A novel hypergraph scheme was also proposed to represent the complex object relations among the applications. Instead of a local measure that depends only on common objects among patterns, we propose a global measure process based on the semantic properties of these patterns in the overall data set. The experiments show the effectiveness of the proposed framework. Apply scenario can reduce the global patch service cost; improve performances and minimum the turnaround time in access the scope of computer games or virtual environments (VE).
Digital Topology on Adaptive Octree Grids
Authors: Ying Bai, Xiao Han, Jerry L. Prince
Venue: Journal of Mathematical Imaging and Vision (2009)

The theory of digital topology is used in many different image processing and computer graphics algorithms. Most of the existing theories apply to uniform cartesian grids, and they are not readily extensible to new algorithms targeting at adaptive cartesian grids. This article provides a rigorous extension of the classical digital topology framework for adaptive octree grids, including the characterization of adjacency, connected components, and simple points. Motivating examples, proofs of the major propositions, and algorithm pseudocodes are provided.
Handling mobility over the network
Authors: Raffaele Bolla, Riccardo Rapuzzi, Matteo Repetto
Venue: Proceedings of the 4th International Conference on Future Internet Technologies (2009)

Future Internet is expected to evolve towards user-centric paradigms, which leverage ubiquitous and pervasive communications. Mobility will be one of the key issues in such evolution. Current mobility protocols have a number of limitations and drawbacks; until now, there is not any general solution that could face all aspects of mobility. The only notable examples are targeted to specific applications. We believe that mobility could be effectively managed through overlay networks at the application layer. In this paper, we motivate our idea and depict some preliminary scenario about this topic.
A two-dimensional empirical mode decomposition method with application for fusing panchromatic and multispectral satellite images
Authors: Wenzhong Shi, Yan Tian, Ying Huang, Haixia Mao, Kimfung Liu
Venue: International Journal of Remote Sensing (2009)

Remote sensing technologies are one of the major research topics in fusing multisource data and generating high-quality satellite images. In this paper, a new two-dimensional empirical mode decomposition (EMD) method is presented and used to fuse high-resolution panchromatic and multispectral images. First, the new two-dimensional EMD technique, which includes determining the ending criterion of the sifting procedure, the method of boundary effect resolving and seeking extrema, is presented. Then, based on the proposed two-dimensional EMD, an image fusion method for high-resolution panchromatic and multispectral images is proposed. Finally, two experiments were conducted to verify the performance of the proposed method. The experimental results demonstrate that the new method is effective and promising in terms of both visual effect and quantitative analysis.
A context-aware service framework for large-scale ambient computing environments
Authors: Ichiro Satoh
Venue: Proceedings of the 2009 international conference on Pervasive services (2009)

This paper presents an infrastructure for building and operating context-aware services in large-scale public spaces. The system is managed in a fully non-centralized manner, provides users with agents, detects the locations of users, and deploys location-aware service-provider agents at computers near their current locations by using active RFID-tags. When a user moves from location to location, the system dynamically deploys his/her service-provider agents at the computers close to the current location by using mobile agent technology. It also introduces user movement as a natural user interface. To demonstrate the utility and effectiveness of the system, we constructed location/user-aware visitor-guide services and experimented with them for two weeks in a public museum. We also discuss the possibility of making the system available in large-scale public spaces.
Argument Based Rule Learning
Authors: Martin Možina, Jure Žabkar, Ivan Bratko
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)

We present a novel approach to machine learning, called ABML (argumentation based ML). This approach combines machine learning from examples with concepts from the field of argumentation. The idea is to provide expert's arguments, or reasons, for some of the learning examples. We require that the theory induced from the examples explains the examples in terms of the given reasons. Thus arguments constrain the combinatorial search among possible hypotheses, and also direct the search towards hypotheses that are more comprehensible in the light of expert's background knowledge. In this paper we implement ABCN2 as an extension of the CN2 rule learning algorithm, and analyze its advantages in comparison with the original CN2 algorithm.
Cloud Computing for Science
Authors: Kate Keahey
Venue: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (2009)

Infrastructure-as-a-Service (IaaS) style cloud computing is emerging as a viable alternative to the acquisition and management of physical resources. This raises several questions. How can we take advantage of the opportunities it offers? Are the current commercial offerings suitable for science? What cloud capabilities are required by scientific applications? What additional infrastructure is needed to take advantage of cloud resources?In this talk, I will describe several application projects using cloud computing in commercial and academic space and discuss the challenges and benefits of this approach in terms of performance, cost, and ease-of-use. I will also discuss our experiences with configuring and running the Science Clouds - a group of clouds in academic domain available to scientific projects configured using the Nimbus Toolkit. Finally, I will discuss the emerging trends and innovation opportunities in cloud computing.
A monotone framework for CCS
Authors: Hanne Riis Nielson, Flemming Nielson
Venue: Computer Languages, Systems and Structures (2009)

The calculus of communicating systems, CCS, was introduced by Robin Milner as a calculus for modelling concurrent systems. Subsequently several techniques have been developed for analysing such models in order to get further insight into their dynamic behaviour. In this paper we present a static analysis for approximating the control structure embedded within the models. We formulate the analysis as an instance of a monotone framework and thus draw on techniques that often are associated with the efficient implementation of classical imperative programming languages. We show how to construct a finite automaton that faithfully captures the control structure of a CCS model. Each state in the automaton records a multiset of the enabled actions and appropriate transfer functions are developed for transforming one state into another. A classical worklist algorithm governs the overall construction of the automaton and its termination is ensured using techniques from abstract interpretation.
Feature location by IR modules and call graph
Authors: Peng Shao, Randy K. Smith
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

When different types of test are performed on software, from unit test, to component test to system test many bugs can be detected and recorded in bug reports. Developers must then fix them one by one. However, an important job before fixing bugs is to locate them in source code. Given a large scale software project with hundreds of bugs, it is a tedious job to locate the problems in source code. Feature location is a solution of this problem. Feature location seeks to identify pieces of source code corresponding to a specific feature, where a feature is defined as a function in software. Since bugs have the same attributes as features, they can be treated as features. In this paper, we provide a technique to achieve feature location. The approach uses a combination of lexical information and structural information. We combine Latent Semantic Indexing with Call Graphs to on a small test case to assist in feature location. Comparing our approach to an approach that uses LSI shows improved accuracy ad effectiveness.