ppxscal/embedding_network huggingface dataset:
Autonomic Resource Management for Multimedia Services Using Inventory Control
Authors: Ramy Farha, Alberto Leon-Garcia
Venue: Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services (2008)

The proliferation of real-time multimedia services has triggered attempts by service providers to seek ways to reduce the cost of managing those services, while satisfying customer demands for the resources involved in the service delivery. A key issue is to avoid costly service interruptions in such real-time multimedia services. In this paper, we propose the use of the inventory control approach from the Operations Research community to remedy to this problem. We show two possible inventory control models to manage the resources involved in real-time multimedia service delivery. We also perform extensive simulations to compare the advantages and disadvantages of the two inventory control models for resource management of real-time multimedia services.
Multi-step ahead direct prediction for the machine condition prognosis using regression trees and neuro-fuzzy systems
Authors: Van Tung Tran, Bo-Suk Yang, Andy Chit Chiow Tan
Venue: Expert Systems with Applications: An International Journal (2009)

This paper presents an approach to predict the operating conditions of machine based on classification and regression trees (CART) and adaptive neuro-fuzzy inference system (ANFIS) in association with direct prediction strategy for multi-step ahead prediction of time series techniques. In this study, the number of available observations and the number of predicted steps are initially determined by using false nearest neighbor method and auto mutual information technique, respectively. These values are subsequently utilized as inputs for prediction models to forecast the future values of the machines' operating conditions. The performance of the proposed approach is then evaluated by using real trending data of low methane compressor. A comparative study of the predicted results obtained from CART and ANFIS models is also carried out to appraise the prediction capability of these models. The results show that the ANFIS prediction model can track the change in machine conditions and has the potential for using as a tool to machine fault prognosis.
Boundary Conditions for Numerical Stability Analysis of Periodic Solutions of Ordinary Differential Equations
Authors: Sunao Murashige
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper considers numerical methods for stability analyses of periodic solutions of ordinary differential equations. Stability of a periodic solution can be determined by the corresponding monodromy matrix and its eigenvalues. Some commonly used numerical methods can produce inaccurate results of them in some cases, for example, near bifurcation points or when one of the eigenvalues is very large or very small. This work proposes a numerical method using a periodic boundary condition for vector fields, which preserves a critical property of the monodromy matrix. Numerical examples demonstrate effectiveness and a drawback of this method.
Preconditioners generated by minimizing norms
Authors: Pablo Tarazaga, Diego Cuellar
Venue: Computers Mathematics with Applications (2009)

We introduce two diagonal preconditioners, one of them is a scaling of the matrix. They are obtained by minimizing the norm of the iteration matrix using the Frobenius and @?"~ norms. We prove convergence of the corresponding iterations for the class of diagonally dominant matrices. For the @?"~ iteration, we also prove convergence for positive definite matrices. Both iterations compete very well with the Jacobi iteration.
Low Complexity Dual-Mode Pulse Generator Designs
Authors: Jin-Fa Lin, Yin-Tsung Hwang, Ming-Hwa Sheu
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Two novel low complexity dual-mode pulse generator designs suitable for FFs with triggering mode control are presented. The proposed designs successfully integrate XOR/OR (AND/XNOR) functions into a unified pass transistor logic (PTL) module to provide control on single-or double-edge operations. The designs use as few as 8 transistors each and ingeniously avoid the signal degradation problem inherent in most PTL circuits. As the only dual-mode designs so far, the proposed designs also outperform rival single-mode designs in both aspects of circuit complexity and power consumption.
Measuring the effectiveness of the s-metric to produce better network models
Authors: Isabel Beichl, Brian Cloteaux
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Recent research has shown that while many complex networks follow a power-law distribution for their node degrees, it is not sufficient to model these networks based only on their degree distribution. In order to better distinguish between these networks, the metric s was introduced to measure how interconnected the hub nodes are in a network. We examine the effectiveness of creating network models based on this metric. Through a series of computational experiments, we compare how well a set of common structural network metrics are preserved between instances of the autonomous system Internet topology and a series of random models with identical degree sequences and similar s values. We demonstrate that creating models based on the s metric can produce moderate improvement in structural characteristics over strictly using degree distribution. Our results also indicate that some interesting relationships exist between the s metric and the various structural metrics.
Self-organized event detection in sensor networks using bio-inspired promoters and inhibitors
Authors: Falko Dressler
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

Sensor and Actor Networks (SANETs) represent a specific category of massively distributed systems in which coordination and control of the participating networked nodes is especially challenging. Recently, a number of self-organization methods have been published that focus on network-centric operation in such networks. Rule-based Sensor Network (RSN) is a programming approach that supports this kind of operation. It mainly features inherent support for heterogeneous nodes. Until now, the rule execution in RSN is too static for application in highly dynamic environments such as event detection of mobile targets. We present a bio-inspired approach for adaptation of the local rule execution, which is based on an promoter/inhibitor scheme. The application of this biological technique leads to improved reactivity and resource utilization. The advantages are demonstrated based on a comprehensive simulation study.
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Authors: Shiyan Hu, Zhuo Li, Charles J. Alpert
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasingly resistive which makes it more difficult to propagate signals across the chip. However, more advanced technologies (65nm and 45nm) provide relief as the number of metal layers continues to increase. The wires on the upper metal layers are much less resistive and can be used to drive further and faster than on thin metals. This provides an entirely new dimension to the traditional wire sizing problem, namely, layer assignment for efficient timing closure. Assigning all wires to thick metals improves timing, however, routability of the design may be hurt. The challenge is to assign minimal amount of wires to thick metals to meet timing constraints. In this paper, the minimum cost layer assignment problem is proven to be NP-Complete. As a theoretical solution for NP-complete problems, a polynomial time approximation scheme is proposed. The new algorithm can approximate the optimal layer assignment solution by a factor of 1 + &epsilon; in O(m log log m &middot; n3/&epsilon;2) time for 0 < &epsilon; < 1, where n is the number of nodes in the tree and m is the number of routing layers. This work presents the first theoretical advance for the timing-driven minimum cost layer assignment problem. In addition to its theoretical guarantee, the new algorithm is highly practical. Our experiments on 500 testcases demonstrate that the new algorithm can run 2x faster than the optimal dynamic programming algorithm with only 2% additional wire.
Better confidence intervals for importance sampling
Authors: Halis Sak, Josef Leydold
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

It is well known that for highly skewed distributions the standard method of using the t statistic for the confidence interval for the mean does not give robust results. This is an important problem for importance sampling (IS) as its final distribution is often skewed due to a heavy tailed weight distribution. On the poster, we first explain the Hall's transformation to correct the confidence interval of the mean and then evaluate the performance of this method for two numerical examples from finance, which have closed form solutions. Finally, we assess the performance of this method for the credit risk examples. Our numerical results suggest that Hall's transformation can be safely used in correcting the confidence intervals of financial simulations.
LEGO for Two-Party Secure Computation
Authors: Jesper Buus Nielsen, Claudio Orlandi
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

This paper continues the recent line of work of making Yao's garbled circuit approach to two-party computation secure against an active adversary. We propose a new cut-and-choose based approach called LEGO (Large Efficient Garbled-circuit Optimization): It is specifically aimed at large circuits. Asymptotically it obtains a factor $\log\vert\mathcal{C}\vert$ improvement in computation and communication over previous cut-and-choose based solutions, where $\vert\mathcal{C}\vert$ is the size of the circuit being computed. The protocol is universally composable (UC) in the OT-hybrid model against a static, active adversary.
Untangling crosscutting concerns in domain-specific languages with domain-specific join points
Authors: Tom Dinkelaker, Martin Monperrus, Mira Mezini
Venue: Proceedings of the 4th workshop on Domain-specific aspect languages (2009)

Like programs written in general-purpose languages, programs written in DSLs may also suffer from tangling and scattering in the presence of domain-specific crosscutting concerns. This paper presents an architecture that supports aspect-oriented features for domain-specific base languages. Both base programs and advices are written in different domain-specific languages. The framework relies on the concept of domain-specific join point.
Clockwise: A Mixed-Media File System
Authors: Peter Bosch, Sape J. Mullender, Pierre G. Jansen
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This (short) paper presents the Clockwise, a mixed-media file system. The primary goal of the Clockwise is to provide a storage architecture that supports the storage and retrieval of best-effort and real-time file system data. Clockwise provides an abstraction called a dynamic partition that groups lists of related (large) blocks on one or more disks. Dynamic partition can grow and shrink in size and reading or writing of dynamic partitions can be scheduled explicitly. With respect to scheduling, Clockwise uses a novel strategy to pre-calculate schedule slack time and it schedules best-effort requests before queued real-time requests in this slack time.
An Optimized eHealth Platfom to Provide Electronic Services over Dynamic Networking Environments
Authors: Pierre Plaza, Nuria Sanz, Jose Luis Gonzalez
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

The paper describes how an eHealth platform is being optimized with several enabling technologies for content and services provisioning over new, more complex network topologies. The services that are to be offered must account for dynamic networking environments which include add-hoc networks on the one-hand, and on the other that are to be offered for groups of users, seamlessly connected by using Peer to Peer communications.
Efficient reconstruction of nonrigid shape and motion from real-time 3D scanner data
Authors: Michael Wand, Bart Adams, Maksim Ovsjanikov, Alexander Berner, Martin Bokeloh, Philipp Jenke, Leonidas Guibas, Hans-Peter Seidel, Andreas Schilling
Venue: ACM Transactions on Graphics (TOG) (2009)

We present a new technique for reconstructing a single shape and its nonrigid motion from 3D scanning data. Our algorithm takes a set of time-varying unstructured sample points that capture partial views of a deforming object as input and reconstructs a single shape and a deformation field that fit the data. This representation yields dense correspondences for the whole sequence, as well as a completed 3D shape in every frame. In addition, the algorithm automatically removes spatial and temporal noise artifacts and outliers from the raw input data. Unlike previous methods, the algorithm does not require any shape template but computes a fitting shape automatically from the input data. Our reconstruction framework is based upon a novel topology-aware adaptive subspace deformation technique that allows handling long sequences with complex geometry efficiently. The algorithm accesses data in multiple sequential passes, so that long sequences can be streamed from hard disk, not being limited by main memory. We apply the technique to several benchmark datasets, significantly increasing the complexity of the data that can be handled efficiently in comparison to previous work.
Service Selection Based on Non-functional Properties
Authors: Stephan Reiff-Marganiec, Hong Qing Yu, Marcel Tilly
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

Service-oriented Architecture supports software to be composed from services dynamically. Selecting and composing appropriate services according to business process, policies and non-functional constraints is an essential challenge. This paper proposes a method for automatic selection of the most relevant service for composition based on non-functional properties and the user's context. In doing this we also propose a method of obtaining and evaluating non-functional aspects.
Virtualization-based separation of privilege: working with sensitive data in untrusted environment
Authors: Igor Burdonov, Alexander Kosachev, Pavel Iakovenko
Venue: Proceedings of the 1st EuroSys Workshop on Virtualization Technology for Dependable Systems (2009)

Contemporary commodity operating systems are too big and do not inspire trust in their security and reliability. Still they are used for processing sensitive data due to the vast amount of legacy software and good support for virtually all hardware devices. Common approaches used to ensure sensitive data protection are either too strict or not reliable. In this article we propose virtualization-based approach for preventing sensitive data leaks from a computer running untrusted commodity OS without sacrificing public network connectivity, computer usability and performance. It is based on separating privileges between two virtual machines: public VM that has unlimited network access and private (isolated) VM that is used for processing sensitive data. Virtual machine monitor uses public VM to provide transparent access to Internet for selected trusted applications running inside the private VM on a system call level. Proposed security architecture allows using one and the same untrusted OS on both virtual machines without necessity to encrypt sensitive data. However it poses a challenge of enforcing dynamic protection over the trusted applications running in the potentially compromised OS. We investigate this problem and provide our solution for it.
Partnering with SAP Vol. 1. Business models for software companies
Authors: Ralf Meyer
Venue:  (2008)

SAP is a very fast growing marketplace with more than 48,000 customers in 120 countries. SAP plans to aggressively grow its customer base to 100,000 by 2010.Partners are already generating billions of dollars in revenues. The question is: How can you leverage SAP for your business? This book provides answers and gives interested readers an overview of the multiple options to partner with SAP.------"The SAP Partnering Handbook is an excellent starting point for anybody in the software industry who wants to leverage the huge SAP ecosystem for their strategic growth plans and learn how to partner with SAP."Franz Baljer / President of the International Association for SAP Partners (IA4SP)------"This book is a must read for those wanting to invest in a partnership with SAP. It not only provides a very good overview of the various partner programs but also provides guidelines on how to leverage them for your own benefit."Paul Jozefak / Venture Capitalist at Neuhaus Partners and formerly at SAP Ventures --------------------------------------------------------------------------------About the Authors:This book was written by a small team of seasoned SAP partnership experts and business development experts at Synomic, a boutique management consultancy with a focus on the SAP ecosystem and software start-ups. The founder of Synomic is Ralf Meyer, who has more than 25 years of experience in the Enterprise Software industry and who has a successful management track record at both SAP AG and international SAP software partners.Consulting services provided by Synomic include:- Alliance Management Consulting - Business & Corporate Development Consulting- Go-To-Market ServicesRalf is also a co-founder and active member of the International Association for SAP Partners e.V. (IA4SP), based in Walldorf /Germany.You can e-mail the authors at partnerbook@synomic.com Further information on Synomic can be found at www.synomic.comInformation on IA4SP can be found at www.ia4sp.org
A Proposal for Recognizing Reputation within Communities of Practice
Authors: Claudia C. Cruz, Maria Teresa Gouvêa, Claudia L. Motta, Flavia M. Santoro
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

One of the most critical points for Communities of Practice is shared information credibility. Professionals only feel secure to reuse solutions presented and discussed within the scope of the community if a process of trusting is well established among its members at that moment. We propose the use of Reputation Systems to promote trust among participants and, consequently, stimulate participation through the recording of relevant information, such as ideas, opinions, solutions, and recommendations.
A low repetition rate passively mode-locked fiber laser
Authors: G. H. Wang, M. Tang, P. Shum, Y. D. Gong, P. C. Tang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

We demonstrated an Yb3+ doped mode-locked fiber ring laser with over 400m cavity length. 444kHz repetition rate wavebreaking free pulse was obtained at 1068nm with 890ps pulse width, 0.29nm bandwidth and 5.2nJ pulse energy. This is the lowest repetition rate in passively mode locked fiber laser to our knowledge
What's mine is mine: territoriality in collaborative authoring
Authors: Jennifer Thom-Santelli, Dan R. Cosley, Geri Gay
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Territoriality, the expression of ownership towards an object, can emerge when social actors occupy a shared social space. In the case of Wikipedia, the prevailing cultural norm is one that warns against ownership of one's work. However, we observe the emergence of territoriality in online space with respect to a subset of articles that have been tagged with the Maintained template through a qualitative study of 15 editors who have self-designated as Maintainers. Our participants communicated ownership, demarcated boundaries and asserted their control over artifacts for the sake of quality by appropriating existing features of Wikipedia. We then suggest design strategies to support these behaviors in the proper context within collaborative authoring systems more generally.
Hybrid analysis of executables to detect security vulnerabilities: security vulnerabilities
Authors: Pranith D. Kumar, Anchal Nema, Rajeev Kumar
Venue: Proceedings of the 2nd India software engineering conference (2009)

Detection of vulnerabilities in executables is one of the major challenges facing the software industry and is mainly due to the unavailability of the source code. In this work, we present a hybrid approach which is a combination of static and dynamic analysis to identify vulnerabilities. In this approach, we first instrument the executable using PIN to extract the control flow and the corresponding assembly code using disassembler. We then perform static analysis on the assembly code for constraint bound checking using control flow and register bounds. In this way, we exploit the synergy between static and dynamic analysis to detect memory leaks, buffer overflow and dangling pointers.
A highly efficient optimization algorithm for pixel manipulation in inverse lithography technique
Authors: Jinyu Zhang, Wei Xiong, Yan Wang, Zhiping Yu, Min-Chun Tsai
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

An efficient algorithm based on the pixel-based mask representation is proposed for fast synthesis of model-based inverse lithography technology (ILT) to improve the resolution and pattern fidelity in optical lithography. This new algorithm reduces N2 intensity computations to three (3) equivalent intensity computations per iteration, where N2 is the total number of pixels in a mask. This algorithm has been demonstrated using different critical dimensions (CDs) and different mask technologies with incoherence and partial-coherence image models. This algorithm is about 60 times faster and more effective than the current gradient-based algorithm. The final image fidelity has quite a weak dependence on the initial condition. Good fidelity images are achieved when CD is reduced to 45nm.