ppxscal/embedding_network huggingface dataset:
Multimedia Document Models - Sealed Fate or Setting Out for New Shores?
Authors: Susanne Boll, Wolfgang Klas, Utz Westermann
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Existing multimedia document models like HTML, MHEG, SMIL, and HyTime lack appropriate modeling primitives to fit the needs of next generation multimedia applications which bring up requirements like reusability of multimedia content in different presentations and contexts, and adaptation to user preferences. In this paper, we motivate and present new requirements stemming from advanced multimedia applications and the resulting consequences for multimedia document models. Along these requirements, we discuss HTML, HyTime, MHEG, SMIL, and ZYX, a new model that has been developed with special focus on reusability and adaptation. The analysis and comparison of the models show the limitations of existing models, point the way to the need for new flexible multimedia document models, and throw light on the many implications on authoring systems, multimedia content management, and presentation.
Reusing web contents: a DOM approach
Authors: L. M. Álvarez-Sabucedo, L. E. Anido-Rifón, J. M. Santos-Gago
Venue: Software&mdash;Practice Experience (2009)

This paper addresses the development of new web sites by reusing already existing contents from external sources. Unlike common links, which retrieve the whole web resource, we propose an approach where partial retrieval is possible. In our case, the unit for reuse is a node in a DOM tree. A suitable proposal for extracting just one single node is presented. This solution permits the partial reuse of external and heterogeneous web contents with no need for client (browser) modifications and with only minor changes for web servers. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Semantics-based context-aware dynamic service composition
Authors: Keita Fujii, Tatsuya Suda
Venue: ACM Transactions on Autonomous and Adaptive Systems (TAAS) (2009)

This article presents a semantics-based context-aware dynamic service composition framework that composes an application through combining distributed components based on the semantics of components and contexts of users. The proposed framework consists of Component Service Model with Semantics (CoSMoS), Component Runtime Environment (CoRE), and Semantic Graph based Service Composition (SeGSeC). CoSMoS models the semantics of components and contexts of users. CoRE is a middleware to support CoSMoS on various distributed computing technologies. SeGSeC is a mechanism to compose an application by synthesizing its workflow based on the semantics of components and contexts of users. The proposed framework is capable of composing applications requested in a natural language by leveraging the semantic information of components. The proposed framework composes applications differently to individual users based on their contexts and preferences. The proposed framework acquires user preferences from user-specified rules and also via learning. The proposed framework also adapts to dynamic environments by autonomously composing a new application upon detecting context change. This article describes the design and mechanism of the proposed framework, and also presents simulation experiments to evaluate the proposed framework.
1000 islands: an integrated approach to resource management for virtualized data centers
Authors: Xiaoyun Zhu, Donald Young, Brian J. Watson, Zhikui Wang, Jerry Rolia, Sharad Singhal, Bret Mckee, Chris Hyser, Daniel Gmach, Robert Gardner, Tom Christian, Ludmila Cherkasova
Venue: Cluster Computing (2009)

Recent advances in hardware and software virtualization offer unprecedented management capabilities for the mapping of virtual resources to physical resources. It is highly desirable to further create a "service hosting abstraction" that allows application owners to focus on service level objectives (SLOs) for their applications. This calls for a resource management solution that achieves the SLOs for many applications in response to changing data center conditions and hides the complexity from both application owners and data center operators. In this paper, we describe an automated capacity and workload management system that integrates multiple resource controllers at three different scopes and time scales. Simulation and experimental results confirm that such an integrated solution ensures efficient and effective use of data center resources while reducing service level violations for high priority applications.
Open Source Web Application Development Stack for Symbian-Based Mobile Phones
Authors: Johan Wikman, Jukka K. Nurminen
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

LAMP is the widely used open source web development stack for building dynamic websites. In this paper, we discuss PAMP (Personal AMP), which is a port of the stack to the Symbian/S60 mobile phone platform. We illustrate the possibilities of PAMP with a couple of examples, share our experiences in bringing the stack to resource-constrained devices, and discuss the lessons learned. The existence of the dominant development environment on handheld devices allows easier development of mobile services with familiar high-level tools. Moreover, it enables reuse of existing solutions like content management systems and integration with other web services such as Facebook.
Artistic Anatomy Based, Real-Time Reproduction of Facial Expressions in 3D Face Models
Authors: Jun Ohya, Jun Kurumisawa, Kazuyuki Ebihara
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper proposes a new real-time method for reproducing facial expressions in 3D face models realistically based on anatomy for artists. To reproduce facial expressions in a face model, the detected expressions need to be converted to the data for deforming the face model. In the proposed method, an artist who has learned anatomy for artists creates arbitrary facial expressions in the 3D face model by mixing the reference expressions chosen by the artist so that the synthesized expressions realistically represent the respective expressions displayed by real persons. The parameters obtained by this manual operations are used to construct the equations that convert the expression features obtained by the detection module to the displacement vectors of the vertices of the face model. During human communications through face models, the equations are used to reproduce the detected expressions in real-time. The effectiveness and robustness of the proposed method were demonstrated by experimental results and demonstration systems.
Automatic generation of local repairs for Boolean programs
Authors: Roopsha Samanta, Jyotirmoy V. Deshmukh, E. Allen Emerson
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

Automatic techniques for software verification focus on obtaining witnesses of program failure. Such counterexamples often fail to localize the precise cause of an error and usually do not suggest a repair strategy. We present an efficient algorithm to automatically generate a repair for an incorrect sequential Boolean program where program correctness is specified using a pre-condition and a post-condition. Our approach draws on standard techniques from predicate calculus to obtain annotations for the program statements. These annotations are then used to generate a synthesis query for each program statement, which if successful, yields a repair. Furthermore, we show that if a repair exists for a given program under specified conditions, our technique is always able to find it.
Six-Sigma project selection using national quality award criteria and Delphi fuzzy multiple criteria decision-making method
Authors: Taho Yang, Chiung-Hsi Hsieh
Venue: Expert Systems with Applications: An International Journal (2009)

Six-Sigma is a tactical tool of significant value in achieving operational excellence. The project selection decision, under a resources constraint, is the early stage of implementation for a Six-Sigma intervention. The project selection decision is challenging due to its fuzzy group decision-making aspect inherent to the problem. The present study proposes to adopt national quality award criteria as the Six-Sigma project selection criteria, and proposes a hierarchical criteria evaluation process. The strategic criteria are evaluated by the management team using a Delphi fuzzy multiple criteria decision-making method. Then, the tactical sub-criteria which contain additional operational issues are evaluated by the Six-Sigma Champion. The proposed methodology is successfully applied in solving the project selection problem deriving from a component manufacturer. The empirical outcomes are promising. Moreover, the results show that the higher a project's priority is, the greater the financial gains will be on completion of the project. Accordingly, the proposed methodology can prioritize the financial gain - which is the key performance indicator for a Six-Sigma project. Additionally, the quality status of the case company has been significantly improved through implementation of the Six-Sigma project. The systematic evaluation process also influences employees to adopt an analytical operations philosophy. Moreover, the commercial objectives of the company are brought into focus by the proposed methodology.
Investigation on doping behavior of copper in ZnO thin film
Authors: Gun Hee Kim, Dong Lim Kim, Byung Du Ahn, Sang Yeol Lee, Hyun Jae Kim
Venue: Microelectronics Journal (2009)

An experiment to determine the electronic and chemical states of Cu in a ZnO crystal was performed using Hall measurement, X-ray photoelectron spectroscopy (XPS) and low-temperature photoluminescence (PL). Cu atoms showed different behaviors in the ZnO matrix as a function of oxygen gas pressure. Metallic copper (Cu^0)-related Cu 2p"3"/"2 peak was observed in highly n-type ZnO:Cu film deposited in 10mTorr. In the Cu-doped p-type ZnO film prepared in 50mTorr, Cu"Z"n^1^+-related peak and small Cu"Z"n^2^+-related satellite peak exhibited and the optical acceptor binding energies of Cu3d^9 and Cu3d^1^0 were 173 and 213meV, respectively.
On the (Im)Possibility of Key Dependent Encryption
Authors: Iftach Haitner, Thomas Holenstein
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

We study the possibility of constructing encryption schemes secure under messages that are chosen depending on the key k of the encryption scheme itself. We give the following separation results that hold both in the private and in the public key settings: Let $\mathcal{H}$ be the family of poly(n)-wise independent hash-functions. There exists no fully-black-box reduction from an encryption scheme secure against key-dependent messages to one-way permutations (and also to families of trapdoor permutations) if the adversary can obtain encryptions of h(k) for $h \in \mathcal{H}$. There exists no reduction from an encryption scheme secure against key-dependent messages to, essentially, any cryptographic assumption, if the adversary can obtain an encryption of g(k) for an arbitrary g, as long as the reduction's proof of security treats both the adversary and the function g as black boxes.
A Simple and Unified Method to Model HVDC Links and FACTS Devices in DC Load Flow
Authors: Omid Alizadeh Mousavi, Mohammad Javad Sanjari, G.B. Gharehpetian, R.A. Naghizadeh
Venue: Simulation (2009)

The DC load flow is a rapid and approximate solution method for the determination of lines active power flows in power systems. In this paper, the HVDC (High Voltage Direct Current) links and FACTS (Flexible AC Transmission Systems) devices have been modeled in the DC load flow analysis. In order to evaluate the performance of the proposed method, the proposed DC load flow results have been compared with the AC or AC-DC load flow results of DIgSILENT software. It is shown that the proposed DC load flow is accurate enough for power system studies.
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
Authors: Taku Aratsu, Kouichi Hirata, Tetsuji Kuboyama
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

In this paper, we give an approximation of the tree edit distance through the string edit distance for binary tree codes, instead of one for Euler strings introduced by Akutsu (2006). Here, a binary tree code is a string obtained by traversing a binary tree representation with two kinds of dummy nodes of a tree in preorder. Then, we show that &sigma;/2&thinsp;&le;&thinsp;&tau;&thinsp;&le;&thinsp;(h&thinsp;+&thinsp;1)&sigma;&thinsp;+&thinsp;h, where &tau; is the tree edit distance between trees, &sigma; is the string edit distance between their binary tree codes and h is the minimum height of the trees.
Test Compression for IP Core Testing with Reconfigurable Network and Fixing-Flipping Coding
Authors: Kazuteru Namba, Yoshikazu Matsui, Hideo Ito
Venue: Journal of Electronic Testing: Theory and Applications (2009)

This paper proposes a class of test compression for IP (intellectual property) core testing. The proposed compression requires only test cubes for the IP cores and it dose not require the structural information about the IP cores. It uses both a reconfigurable network and classes of coding, namely fixing-flipping coding and fixing-shifting-flipping coding. The proposed compression is evaluated from the viewpoint of compression rates and hardware overhead. For three out of four large ISCAS89 benchmark circuits, the compression rates of the proposed compression are better than those of the four existing test compressions.
Fast object search on road networks
Authors: Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search space pruning technique and providing a dynamic object mapping mechanism, ROAD is very efficient and flexible for various types of queries, namely, range search and nearest neighbor search, on objects over large-scale networks. ROAD is named after its two components, namely, Route Overlay and Association Directory, designed to address the network traversal and object access aspects of the framework. In ROAD, a large road network is organized as a hierarchy of interconnected regional sub-networks (called Rnets) augmented with 1) shortcuts for accelerating network traversals; and 2) object abstracts for guiding traversals. In this paper, we present (i) the Rnet hierarchy and several properties useful to construct Rnet hierarchy, (ii) the design and implementation of the ROAD framework, (iii) efficient object search algorithms for various queries, and (iv) incremental update techniques for framework maintenance in presence of object and network changes. We conducted extensive experiments with real road networks to evaluate ROAD. The experiment result shows the superiority of ROAD over the state-of-the-art approaches.
One-Class Collaborative Filtering
Authors: Rong Pan, Yunhong Zhou, Bin Cao, Nathan N. Liu, Rajan Lukose, Martin Scholz, Qiang Yang
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Many applications of collaborative filtering (CF), such as news item recommendation and bookmark recommendation, are most naturally thought of as one-class collaborative filtering (OCCF) problems. In these problems, the training data usually consist simply of binary data reflecting a user's action or inaction, such as page visitation in the case of news item recommendation or webpage bookmarking in the bookmarking scenario. Usually this kind of data are extremely sparse (a small fraction are positive examples), therefore ambiguity arises in the interpretation of the non-positive examples. Negative examples and unlabeled positive examples are mixed together and we are typically unable to distinguish them. For example, we cannot really attribute a user not bookmarking a page to a lack of interest or lack of awareness of the page. Previous research addressing this one-class problem only considered it as a classification task. In this paper, we consider the one-class problem under the CF setting. We propose two frameworks to tackle OCCF. One is based on weighted low rank approximation; the other is based on negative example sampling. The experimental results show that our approaches significantly outperform the baselines.
A Two-Dimensional Logical Coordinate System for Hexagonal Grids in MANETs
Authors: Huiling Cao, Guojun Wang, Yongming Xie
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Hexagonal grid is a popular and powerful network model in various networks and especially in the Mobile Ad-hoc NETworks (MANETs). To the best of our knowledge, however, there is no suitable coordinate system for the hexagonal grids. So it has been a big challenge to solve the node location problem for hexagonal grids in MANETs. In this paper, we propose an intuitive and simple two-dimensional logical coordinate system for hexagonal grids, and we propose a novel approach that maps the hexagonal grids to traditional rectangular grids based on the proposed coordinate system. Given the two-dimensional coordinate of any node in MANETs, the hexagonal grid where the node resides can be computed by the proposed approach. The location of the hexagon center can be computed easily, which is important for location-based routing protocols in MANETs.
Differentiated Domain Protection Algorithm Based on Virtual Topology Graph in Multi-Domain Optical Networks
Authors: Yu Zhang, Lei Guo, Xingwei Wang, Xiaobing Zheng, Xuekui Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

This paper proposes a novel Differentiated Domain Protection (DDP) algorithm to address survivability in multi-domain optical networks. In order to ensure the principle of transparent management in multi-optical domains, DDP abstracts the multi-domain optical networks to Virtual Topology Graph (VTG) to solve the inter-domain routing. In order to satisfy the survivable requirements of different domains, DDP considers the differentiated protection in different domains. Compared with traditional algorithms, DDP not only has the performance trade-off ability but also has the better resource utilization ratio. Simulation results are shown to be promising.
Face Tracking Based on 3D Positional Hypothesis
Authors: Yuzuko Utsumi, Yoshio Iwai, Masahiko Yachida
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

Probabilistic and statistical model analysis methods based on the Bayesian approach have recently been applied to face tracking. Here, we propose a face tracking method based on a Bayesian framework of image sequences. We assume that an observed space is three-dimensional (3D) and model facial shape, rotation and translation in 3D. A 3D positional hypothesis is generated using the facial translation model. The likelihood of facial existence is calculated from the output of the classifier learned using the AdaBoost M1algorithm. The results of an experiment show the efficiency of the proposed method for face tracking.
Multi-attribute Decision-Making Model Based on Grey Game Theory with Mixed Strategy
Authors: Chen Wang, Jun Chen
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

As for the multi-attribute decision-making problem, most common methods used based on AHP are imprecise and complicated for taking weights of indices into account. The paper introduces game theory avoiding the discussion of weights which are inevitable in the normal decision-making model like AHP, DEA, and ANP, FUZZY and so on. Then it combines grey theory to establish a grey game theory model to solve the multi-attribute decision. Analyzing the corresponding theory of the grey game theory, it transforms the model into grey linear programming and gives the answer with mixed strategy which can be validated when iterated elimination of strictly dominated strategy fails. At last, it verifies the feasibility of the model with the given example.
e-government: state and perspectives
Authors: Roland Traunmüller, Christine Leitner
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

The state of e-Government in Europe is presented which is based on the results of the European e-Government Awards 2007 competition. It starts with an overall view on progress and the development of public services. Waves of progress can be discerned as well as diversities in pace and sophistication. Then the contribution focuses on selected challenges: joining up administrations by having interoperability and identity management; higher usage achieved by better service and knowledge enhancement; improvements in citizen participation.
Coverage of generalized confidence intervals
Authors: Anindya Roy, Arup Bose
Venue: Journal of Multivariate Analysis (2009)

Generalized confidence intervals provide confidence intervals for complicated parametric functions in many common practical problems. They do not have exact frequentist coverage in general, but often provide coverage close to the nominal value and have the correct asymptotic coverage. However, in many applications generalized confidence intervals do not have satisfactory finite sample performance. We derive expansions of coverage probabilities of one-sided generalized confidence intervals and use the expansions to explain the nonuniform performance of the generalized intervals. We then show how to use these expansions to obtain improved coverage by suitable calibration. The benefits of the proposed modification are illustrated via several examples.
Pedagogically founded courseware generation based on HTN-planning
Authors: Carsten Ullrich, Erica Melis
Venue: Expert Systems with Applications: An International Journal (2009)

Course generation enables the automatic assembly of course (ware) adapted to the learner's competencies and learning goals. It offers a middle-way between traditional pre-authored ''one-size fits all'' courseware and manual resource look-up. Such an assembly requires pedagogical knowledge, represented, for instance, as expert system rules or planning operators. In this article, we describe the course generation framework Paigos that enables the formalization and application of complex and realistic pedagogical knowledge. Compared to previous course generation approaches, it generates structured courses that are adapted to a variety of learning goals and to the learners' competencies. We describe basic operators and methods for course generation, which are used to formalize seven different types of courses. Furthermore, we present the results of technical evaluations that investigated the performance of the proposed framework. Among others, the results show that Paigos takes less than a second to generate complex courses with an average learning time of about twelve hours. The results also show that large amounts of educational resources are required for an adaptive pedagogically founded course generation.
Conjugate topology of pointwise metric molecular lattices
Authors: Jian-zhong Xiao, Xing-hua Zhu
Venue: Fuzzy Sets and Systems (2009)

In this paper the pointwise pseudo-metric for molecular lattices introduced by Shi is studied. A series of expressions concerning neighborhood balls and remote-neighborhood balls are obtained. Some algebraic properties of the pointwise pseudo-metric function of molecular lattices are presented and their topological structure are discussed in terms of the conjugate families of mappings. These results show that there exist conjugate relations between neighborhoods and remote-neighborhoods.