ppxscal/embedding_network huggingface dataset:
Back-Edge Heuristic for Efficient Data Distribution in Grid Systems
Authors: Marek Ciglan, Ladislav Hluchy
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

This paper focuses on the optimization of the data delivery from a single site to multiple sites, suitable for distributed grid infrastructure, using knowledge of its topology. When formalized, from graph-theoretic point of view, this problem shows to be NP-hard. Thus approximate solutions are used in practice. We present new heuristic for construction of distribution trees that are used in the data delivery process. Proposed solution is compared with two existing algorithms, using computer simulation for the evaluation. Results are encouraging, showing better throughput of distribution trees constructed by the proposed method compared to others.
Optimal Allocation for Complex Systems' Safety
Authors: Yan Zhao, Zhong Han
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

To solve the question of guaranteeing the safety of a system with a complex structure and tight couplings, a new method of optimal allocation exploiting the dynamical planning theory is presented. Two key factors that can affect system safety, i.e., accident loss and accident rate are analyzed. Then, to measure comprehensively requirements of system safety, accident safety level is defined based on these two factors. Subsequently, optimal allocation for complex systems’ safety resource is implemented according to the network properties of the inherent structures of the systems and constraint conditions for safe investments. Finally, a case study shows that the method using dynamical planning for optimal allocation of system safety can ensure preferential allocations of the parts with high safety requirements. Besides, this optimal allocation method is feasible and valid.
Distributed audio-Visual Archives Network (DiVAN)
Authors: Andreas Tirakis, Panagiotis Katalagarianos, Michael Papathomas, Christodoulos Hamilakis
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The ESPRIT project DiVAN (EP 24956) aims at the building of a distributed audio-visual library system for TV broadcasters and video archives owners. The DiVAN system provides facilities to effectively digitize, annotate, organize, store and access raw material in a coherent content-based manner, on top of high-speed wide area communication networks. Also, the project aims to demonstrate and assess the applicability and acceptability of the proposed system, through field trials on a DiVAN-based infrastructure interconnecting the archives of the users of the partnership, i.e. INA, RAI, and ERT. The consortium consists of industrial partners (i.e. INTRACOM, TECMATH), research institutes (i.e. ICS-FORTH, INRIA, Tech. Un. of Darmstadt) and users (i.e. Institut National de l? Audiovisuel-INA, Radiotelevisione Italiana-RAI and Greek National Broadcaster-ERT).
Papyres: A Research Paper Management System
Authors: Amine Naak, Hicham Hage, Esma Aïmeur
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

In the context of a research and development department of an enterprise, researchers regularly access, review, and use large amounts of literature, yet none of the exiting tools and solutions provide the wide range of functionalities required to properly manage these resources. Indeed, bibliography management systems manage the references and citations but fail to help researchers handle and locate resources. On the other hand, research paper recommendation systems and specialized search engines help researchers locate new resources, but again fail to help researchers manage the resources. Finally, Enterprise Content Management systems offer the required functionalities to manage resources and knowledge, but are not designed for research literature. In this work we propose a new class of management systems: Research Paper Management Systems. Moreover, to illustrate our approach we highlight our system Papyres which combines various tools and functionalities, including Web2.0 technique, enabling researchers to maintain and manipulate bibliographies, as well as to manage and share resources and knowledge. Finally, we report on the implementation and validation of Papyres.
Dynamic video summarization using two-level redundancy detection
Authors: Yue Gao, Wei-Bo Wang, Jun-Hai Yong, He-Jin Gu
Venue: Multimedia Tools and Applications (2009)

The mushroom growth of video information, consequently, necessitates the progress of content-based video analysis techniques. Video summarization, aiming to provide a short video summary of the original video document, has drawn much attention these years. In this paper, we propose an algorithm for video summarization with a two-level redundancy detection procedure. By video segmentation and cast indexing, the algorithm first constructs story boards to let users know main scenes and cast (when this is a video with cast) in the video. Then it removes redundant video content using hierarchical agglomerative clustering in the key frame level. The impact factors of scenes and key frames are defined, and parts of key frames are selected to generate the initial video summary. Finally, a repetitive frame segment detection procedure is designed to remove redundant information in the initial video summary. Results of experimental applications on TV series, movies and cartoons are given to illustrate the proposed algorithm.
Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
Authors: Meirun Chen, Xiaofeng Guo
Venue: Information Processing Letters (2009)

An adjacent vertex-distinguishing edge coloring of a simple graph G is a proper edge coloring of G such that incident edge sets of any two adjacent vertices are assigned different sets of colors. A total coloring of a graph G is a coloring of both the edges and the vertices. A total coloring is proper if no two adjacent or incident elements receive the same color. An adjacent vertex-distinguishing total coloring h of a simple graph G=(V,E) is a proper total coloring of G such that H(u)=3 and @g"a"t(Q"n)=@D(Q"n)+2 for n>=2.
An Efficient Semantic-Based Search Schema in Unstructured P2P Network
Authors: Xin Sun, Zhao Chao, Yushu Liu, Lei Zhang
Venue: International Journal of Distributed Sensor Networks (2009)

How to efficiently organize and manage distributed resources is a critical issue of P2P systems. In this paper, we focus on both the P2P search mechanism and the topology structure of overlay network which are the key factors to dominate the performance of resource search and discovery. We mostly concern these issues as follows. Heterogeneity of nodes in P2P networks. Topology match between the P2P overlay network and the underlying physical network. In general, most peers that hold similar shared resources have similar requirements. We consider all the factors mentioned above, and propose a semantic-based and locality-aware hybrid P2P architecture (SLHP) including the method of model construction and maintenance and the multi-root mechanism to avoid the single point failure. SLHP considers the physical locality and the semantic similarity of the shared resource at the same time, in which nodes are clustered into domains according to the physical distance, and the nodes in a domain are clustered into groups according to the similar shared resource. The physical distance is measured by the RTT value of two peers. The calculation method of semantic similarity is also given. And then a semantic-based search schema is proposed. When the search occurs, the query is forwarded to super peers, and among super peers the query is forwarded to the neighbors who have the most similar shared resource with the query keyword. We also give a proof that according to the algorithm of construction and maintenance of SLHP, it is ensured that the existed resource must be found in theory. The semantic-based search can reduce the number of the transferred messages comparing with the standard flooding scheme, since it only produces k messages each hop, and forward to the most expected peers. Along with the routing indices being optimized continuously, which represents the knowledge of nodes about the entire overlay network, the hit ratio can be improved. Finally, in order to evaluate the performance of semantic-based search schema, three sets of simulations are set up to evaluate the key features of the network topology and semantic-based search algorithm. Experimental results show that the semantic-based search schema can reduce the search space, and get a good tradeoff between the performance and the overhead.
A Framework for Using Web Services to Enhance QoS for Content Delivery
Authors: Francesco Buccafurri, Pasquale De Meo, Gianluca Lax, Domenico Ursino, Mariagrazia Fugini, Stefano Modafferi, Barbara Pernici, Roberto Furnari, Anna Goy, Pasquale Lops, Domenico Redavid, Giovanni Semeraro
Venue: IEEE MultiMedia (2009)

An integrated approach to quality of service for content delivery using Web services includes quality definitions, user contracts, and fault monitoring.
Research on the Construction of Mobile Learning Service
Authors: Chunlian Li, Ying Lin, Yu Sun, Lili Dou, Bing Han
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

In this paper we propose grid information service series model and system software architecture of mobile learning service, Mobile learning service is realized by WebService based on grid, which can provide a programming interface for the majority of the software vendors who develop education platform based on mobile learning technology. The service permits reusing not only the code but also the data resources behind the code, has strong applicability.
Tree Decontamination with Temporary Immunity
Authors: Paola Flocchini, Bernard Mans, Nicola Santoro
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Consider a tree network that has been contaminated by a persistent and active virus: when infected, a network site will continuously attempt to spread the virus to all its neighbours. The decontamination problem is that of disinfecting the entire network using a team of mobile antiviral system agents, called cleaners, avoiding any recontamination of decontaminated areas. A cleaner is able to decontaminate any infected node it visits; once the cleaner departs, the decontaminated node is immune for t &ge; 0 time units to viral attacks from infected neighbours. After the immunity time t is elapsed, re-contamination can occur. The primary research objective is to determine the minimum team size, as well as the solution strategy, that is the protocol that would enable such a minimal team of cleaners to perform the task. The network decontamination problem has been extensively investigated in the literature, and a very large number of studies exist on the subject. However, all the existing work is limited to the special case t = 0. In this paper we examine the tree decontamination problem for any value t &ge; 0. We determine the minimum team size necessary to disinfect any given tree with immunity time t. Further we show how to compute for all nodes of the tree the minimum team size and implicitly the solution strategy starting from each starting node; these computations use a total of &theta;(n) time (serially) or &theta;(n) messages (distributively). We then provide a complete structural characterization of the class of trees that can be decontaminated with k agents and immunity time t; we do so by identifying the forbidden subgraphs and analyzing their properties. Finally, we consider generic decontamination algorithms, i.e. protocols that work unchanged in a large class of trees, with little knowledge of their topological structure. We prove that, for each immunity time t &ge; 0, all trees of height at most h can be decontaminated by a team of $k=\lfloor {{2 h} \over t+2 }\rfloor$ agents whose only knowledge of the tree is the bound h. The proof is constructive.
Scalability and parallel execution of warp processing: dynamic hardware/software partitioning
Authors: Roman Lysecky
Venue: International Journal of Parallel Programming (2008)

Warp processors are a novel architecture capable of autonomously optimizing an executing application by dynamically re-implementing critical kernels within the software as custom hardware circuits in an on-chip FPGA. Previous research on warp processing focused on low-power embedded systems, incorporating a low-end ARM processor as the main software execution resource. We provide a thorough analysis of the scalability of warp processing by evaluating several possible warp processor implementations, from low-power to high-performance, and by evaluating the potential for parallel execution of the partitioned software and hardware. We further demonstrate that even considering a high-performance 1 GHz embedded processor, warp processing provides the equivalent performance of a 2.4GHz processor. By further enabling parallel execution between the processes and FPGA, the parallel warp processor execution provides the equivalent performance of a 3.2 GHz processor.
A Collaborative Bayesian Image Annotation Framework
Authors: Rui Zhang, Kui Wu, Kim-Hui Yap, Ling Guan
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

The integration of content and context information within an image annotation framework is studied, which refer to the low-level visual features and the co-occurrence of different real world objects in a probabilistic sense, respectively. Conventional annotation approaches fail to collect and utilize the context information. Therefore, we proposed a new framework, termed as Collaborative Bayesian Image Annotation (CBIA) framework. 1) In addition to the content information, the proposed system accumulates past annotation results and/or information actively provided by domain experts, from which the context knowledge is extracted. Hence, part of the system is collaboratively constructed by human users. 2) The above information is utilized through a Bayesian framework. Numerical results based on images collected from the Internet demonstrated better performance resulting from the introduction of context knowledge and information fusion.
A network management tool for resource-partition based layer 1 virtual private networks
Authors: Jing Wu, Michel Savoie, Scott C&bell, Hanxi Zhang
Venue: International Journal of Network Management (2009)

A Layer 1 Virtual Private Network (L1-VPN) has two models for service management: the resource-partition based model and the domain-service based model. In this paper, we present a network management tool for resource-partition based L1-VPNs. A Transaction Language One (TL1) proxy is designed to achieve resource partitioning at the network element level. Building on top of a TL1 proxy, we implemented a User-Controlled LightPath (UCLP) system to support physical network brokers to assign and allocate virtually dedicated resources to customers, and to enable customers to directly manage their resources. With such a capability, customers are able to create wide area networks based on their traffic pattern, and to adjust their traffic pattern based on available resources.
UML4ODP: OCL 2.0 constraints specification & UML modeling of interfaces in the computational metamodel
Authors: Oussama Reda, Bouabid El Ouahidi, Daniel Bourget
Venue: WSEAS Transactions on Computers (2009)

The purpose of this work is analysis of computational language concepts and introduction of novel pertinent ones in order to provide a new computational metamodel of interaction signatures in UML4ODP FDIS. we mainly introduce the concept of Functional computational interface which unify signal and operation interfaces notions. The unification of signal and operation interactions concepts is presented by introducing the Parameterized interaction concept. We show that parameterized interactions are of two main kinds; namely, primitives and compounds. we also introduce the notion of incoming and outgoing primitives. As an application of our modeling choices we redefine interaction, refinement and type checking rules in a concise manner, and then specify them using the useful specification functionalities of OCL 2.0, showing how novel definitions as well as their specification are easy to read, write and understand.
SenseCam Image Localisation Using Hierarchical SURF Trees
Authors: Ciarán Ó Conaire, Michael Blighe, Noel E. O'Connor
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

The SenseCam is a wearable camera that automatically takes photos of the wearer's activities, generating thousands of images per day. Automatically organising these images for efficient search and retrieval is a challenging task, but can be simplified by providing semantic information with each photo, such as the wearer's location during capture time. We propose a method for automatically determining the wearer's location using an annotated image database, described using SURF interest point descriptors. We show that SURF out-performs SIFT in matching SenseCam images and that matching can be done efficiently using hierarchical trees of SURF descriptors. Additionally, by re-ranking the top images using bi-directional SURF matches, location matching performance is improved further.
Object tracking using SIFT features and mean shift
Authors: Huiyu Zhou, Yuan Yuan, Chunmei Shi
Venue: Computer Vision and Image Understanding (2009)

A scale invariant feature transform (SIFT) based mean shift algorithm is presented for object tracking in real scenarios. SIFT features are used to correspond the region of interests across frames. Meanwhile, mean shift is applied to conduct similarity search via color histograms. The probability distributions from these two measurements are evaluated in an expectation-maximization scheme so as to achieve maximum likelihood estimation of similar regions. This mutual support mechanism can lead to consistent tracking performance if one of the two measurements becomes unstable. Experimental work demonstrates that the proposed mean shift/SIFT strategy improves the tracking performance of the classical mean shift and SIFT tracking algorithms in complicated real scenarios.
DA-IICT Cross-lingual and Multilingual Corpora for Speaker Recognition
Authors: Hemant A. Patil, Sunayana Sitaram, Esha Sharma
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper the design and development of the DA-IICT Cross-lingual and Multilingual Speech Corpora is presented which includes unconventional sounds like cough, whistle, whisper, frication, idiosyncrasies, etc. from bilingual subjects (i.e., who can speak Hindi and Indian English) and trilingual subjects (who can speak Hindi, Indian English and mother tongue) for the development of Automatic Speaker Recognition System. Thirteen Indian languages and the Nepali language are considered as the subjects’ mother tongue/native languages. Unconventional sounds are considered to examine how much speaker-specific information they carry. Finally, an ASR system based on spectral or cepstral features (i.e., LPC, LPCC, MFCC) and polynomial classifier of 2nd order approximation is presented to evaluate the developed corpora.
Finding the Most Balanced Delay Constrained Path
Authors: Yujie Pei, Hongbo Wang, Boubacar Kimba dit Adamou, Shiduan Cheng
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Sometimes the backbone network of Internet experiences congestion because traffic is not distributed rationally. This fact may lead network resources utilized inefficiently. The main idea for load balancing is to alter the route for some traffic. But current approaches with this idea often get such a long route that decrease the quality of service. This paper presents a new flow routing adjustment algorithm which can substantially balance the traffic of network with delay constrained to some extent. With simulation method, it is proved that, compared with current methods, the new algorithm can improve the throughput of network greatly and at the same time provide quality of service guarantee. Moreover, the theoretical analysis shows that the computational complexity of the new algorithm is $(N^2logN), which is better than that of most current methods.
Quel outil d'&eacute;valuation de l'acceptabilit&eacute; des nouvelles technologies pour des &eacute;tudes francophones?
Authors: Florence Février, Eric Jamet, Géraldine Rouxel
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

This paper describes the first step of a larger research concerning the establishment of a new technology acceptance model. Our final purpose aims at creating a French-speaking tool to evaluate intentions to use new systems. We wanted this tool to be constructed on the basis of an existing model, wherein we planed to incorporate an emotional dimension. Referring to the literature, we considered the TAM (Technology Acceptance Model, [3, 4]) as a reliable groundwork. We translated items into French and checked we recovered the factorial structure of TAM. We did this by assessing the intentions to use the digital work environment of the university. 192 students, registered for the first time in the university, constituted our sample. We ran the statistical analysis and then noted that we did not recover the original factorial structure of TAM. This result is surprising at first sight and is discussed in the last part. We conclude this paper by presenting the next steps of our research.
Local Whittle estimator for anisotropic random fields
Authors: Hongwen Guo, Chae Young Lim, Mark M. Meerschaert
Venue: Journal of Multivariate Analysis (2009)

A local Whittle estimator is developed to simultaneously estimate the long memory parameters for stationary anisotropic scalar random fields. It is shown that these estimators are consistent and asymptotically normal, under some weak technical conditions. A brief simulation study illustrates a practical application of the estimator.
The Automatic Compensation of Wheel-cutting's Rotational Speed Based on Metallographic Sample Cutting Machine
Authors: Xuehua Ji, Jigang Li, Weilian Sun, Jianyong Ma, Chaoying Guo
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

During the cutting machine’s work time, the wear of the cutting piece is a constant process of gradually wear. So it is difficult to ensure the accuracy and efficiency of processing. This paper introduces the principles and compositions of a linear CCD diameter measurement system, makes a non-contact automated on-line measurement for the grinding wheel diameter; as for the wear capacity of the grinding wheel piece, it realizes the automatic compensation of rotational speed.