ppxscal/embedding_network huggingface dataset:
The Complexity of SPP Formula Minimization
Authors: David Buchfuhrer
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Circuit minimization is a useful procedure in the field of logic synthesis. Recently, it was proven that the minimization of (&or;,&deg;,&not;) formulae is hard for the second level of the polynomial hierarchy [BU08]. The complexity of minimizing more specialized formula models was left open, however. One model used in logic synthesis is a three-level model in which the third level is composed of parity gates, called SPPs. SPPs allow for small representations of Boolean functions and have efficient heuristics for minimization. However, little was known about the complexity of SPP minimization. Here, we show that SPP minimization is complete for the second level of the Polynomial Hierarchy under Turing reductions.
Home Multimedia Systems: On Personal Video Librarries
Authors: M. Ceccarelli, G. Mekenkamp, E. Persoon
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The fruition of multimedia content will changedramatically thanks to new digital home platforms. Large capacity home storage devices will allow for local caching of audiovisual content from broadcast services. Auxiliary information on TV programmes delivered via online service will complement the video content, enabling automatic filtering and search capabilities on the receiving system. The AVIR project investigates on new scenarios for the usage of home video databases.
In search of the memoryless property
Authors: Timothy S. Vaughan
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper describes a distribution fitting exercise that has been used in an undergraduate introductory simulation class. The intent is for students to collect data describing a customer arrival process, with the goal of determining whether the exponential distribution is a good fit. The paper briefly reviews the memoryless property, and presents some teaching tips directed toward students' understanding of the concept. The data collection exercise is then presented, with attention to common pitfalls students have encountered in the past. A presentation of the variety of distributions that emerge as "best fitting", when samples are actually drawn from an exponential distribution, serves as a warning against over-reliance on goodness of fit measures. 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
An improved binary particle swarm optimization for unit commitment problem
Authors: Xiaohui Yuan, Hao Nie, Anjun Su, Liang Wang, Yanbin Yuan
Venue: Expert Systems with Applications: An International Journal (2009)

This paper proposes a new improved binary PSO (IBPSO) method to solve the unit commitment (UC) problem, which is integrated binary particle swarm optimization (BPSO) with lambda-iteration method. The IBPSO is improved by priority list based on the unit characteristics and heuristic search strategies to repair the spinning reserve and minimum up/down time constraints. To verify the advantages of the IBPSO method, the IBPSO is tested and compared to the other methods on the systems with the number of units in the range of 10-100. Numerical results demonstrate that the IBPSO is superior to other methods reported in the literature in terms of lower production cost and shorter computational time.
Managing long-running queries
Authors: Stefan Krompass, Harumi Kuno, Janet L. Wiener, Kevin Wilkinson, Umeshwar Dayal, Alfons Kemper
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Business Intelligence query workloads that run against very large data warehouses contain queries whose execution times range, sometimes unpredictably, from seconds to hours. The presence of even a handful of long-running queries can significantly slow down a workload consisting of thousands of queries, creating havoc for queries that require a quick response. Long-running queries are a known problem in all commercial database products. However, we have not seen a thorough classification of long-running queries nor a systematic study of the most effective corrective actions. We present here a systematic study of workload management policies, including many implemented by commercial database vendors. Our goal is to enable a system to: (1) recognize long-running queries and categorize them in terms of their impact on performance and (2) determine and take (automatically!) the most effective control actions to remedy the situation. To this end, we identify common workload management scenarios involving long-running queries, and create a taxonomy of long-running queries. We carry out an extensive set of experiments to evaluate different management policies and the relative and absolute thresholds that they may use. We find that in some scenarios, the right combination of policies can reduce the runtime of a workload by a factor of two, but that in other scenarios, any action taken increases runtime. One surprising result was that relative thresholds for execution control can compensate for inaccurate cost estimates, so that Kill&Requeue actions perform as well as Suspend&Resume.
Temporal Integrity Constraints in Interactive Multimedia Documents
Authors: I Mirbel, B. Pernici, M. Vazirgiannis
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

When authoring multimedia scenarios, and in particular scenarios with user interaction, where the sequence and time of occurrence of interactions is not predefined, it is difficult to guarantee the consistency of the resulting scenarios. As a consequence, the execution of the scenario may result in unexpected behavior or inconsistent use of media. The present paper proposes to use temporal constraint verification techniques in a methodology for checking the temporal integrity of Interactive Multimedia Document scenarios at authoring time at various levels.
We saw each other on the subway: secure, anonymous proximity-based missed connections
Authors: Justin Manweiler, Ryan Scudellari, Zachary Cancio, Landon P. Cox
Venue: Proceedings of the 10th workshop on Mobile Computing Systems and Applications (2009)

There is an inherent tension between the value provided by Location-Based Services (LBSs) and the location-privacy concerns they raise. Unfortunately, users are often forced to either boycott LBS applications completely or fully trust a centralized service with their location data. In this paper, we propose several techniques for resolving this tension. In particular, we present a mechanism by which peers who shared a physical location and time can be matched by a central server, without compromising peer-to-server or peer-to-peer anonymity. We utilize k-anonymity techniques to maintain location privacy and cryptographic techniques to provide both a proof of this co-location and an end-to-end confidential channel that is invulnerable to server snooping and man-in-the-middle attacks.
A hybrid surface tension seal for pneumatic and hydraulic microactuators
Authors: Micha&#x00eb;l F. L. De Volder, Dominiek Reynaerts
Venue: Microsystem Technologies (2009)

Recent research revealed that microactuators driven by pressurized fluids are able to generate high power and force densities at microscale. One of the main technological barriers in the development of these actuators is the fabrication low friction seals. This paper presents a novel scalable seal technology, which resists the actuation pressure relying on a combination of a clearance seal and a surface tension seal. This approach allows to seal pressures of more than 800&#x00a0;kPa without leakage. The seal is tested on an actuator with a bore of 0.8&#x00a0;mm&#x00b2; and a length of 13&#x00a0;mm, which was able to generate forces up to 0.32&#x00a0;N.
A clustering analysis and agent-based trust model in a grid environment supporting virtual organisations
Authors: Junzhou Luo, Xudong Ni
Venue: International Journal of Web and Grid Services (2009)

Grid computing enables coordinated resource sharing in dynamic, distinct Virtual Organisations (VOs), which consist of different grid entities from traditional organisations. Recently, the main solution of grid security is applying trust as an important factor in grid computing to realise cooperation between unknown entities, especially for VOs. However, most of the research work inherits the concept of trust from Peer-to-Peer (P2P) networks and does not accurately satisfy the requirements in a grid environment. In this paper, we present a clustering analysis and agent-based trust model that introduces VO trust relationships into traditional grid entities, with which we can more effectively and dynamically share grid resources. We also propose a clustering analysis method to evaluate grid entities' trust in VOs and a weighted path to compute the transitivity of trust. In addition, two kinds of agents are introduced to the trust evaluation process to collaborate on and accomplish trust computation between VOs. The VO agent is a resident agent that stays in a VO which initiates search agent to collect information. A search agent is a mobile agent and is usually dispatched to many VO nodes. The simulation result shows that our model improves the overall performance of grid systems.
Wire shaping is practical
Authors: Hongbo Zhang, Martin D.F. Wong, Kai-Yuan Chao, Liang Deng
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

Wire shaping for delay/power minimization has been extensively studied. Due to the perceived high design and manufacturing costs for using non-uniform wire shapes, wire shaping is generally considered to be impractical. In this paper, we present a practical wire shaping methodology. Non-uniform wire shapes are directly implemented on silicon wafer instead of in GDSII during design. We present novel enhancements to existing OPC technology to accurately print non-uniform wire shapes. Experimental results show that the post-OPC mask complexities of uniform wire and non-uniform wire are comparable. With minimal impact on the design and manufacturing flows and minimal additional design and manufacturing costs, we demonstrate that wire shaping can help to obtain substantial reduction of interconnect dynamic power without affecting timing closure. Our wire shaping methodology is an excellent example of Manufacturing for Design.
Salkowski curves revisited: A family of curves with constant curvature and non-constant torsion
Authors: J. Monterde
Venue: Computer Aided Geometric Design (2009)

In the paper [Salkowski, E., 1909. Zur Transformation von Raumkurven, Mathematische Annalen 66 (4), 517-557] published one century ago, a family of curves with constant curvature but non-constant torsion was defined. We characterize them as space curves with constant curvature and whose normal vector makes a constant angle with a fixed line. The relation between these curves and rational curves with double Pythagorean hodograph is studied. A method to construct closed curves, including knotted curves, of constant curvature and continuous torsion using pieces of Salkowski curves is outlined.
Intrusion detection with evolutionary learning classifier systems
Authors: Kamran Shafi, Tim Kovacs, Hussein A. Abbass, Weiping Zhu
Venue: Natural Computing: an international journal (2009)

Evolutionary Learning Classifier Systems (LCSs) combine reinforcement learning or supervised learning with effective genetics-based search techniques. Together these two mechanisms enable LCSs to evolve solutions to decision problems in the form of easy to interpret rules called classifiers. Although LCSs have shown excellent performance on some data mining tasks, many enhancements are still needed to tackle features like high dimensionality, huge data sizes, non-uniform distribution of classes, etc. Intrusion detection is a real world problem where such challenges exist and to which LCSs have not previously been applied. An intrusion detection problem is characterised by huge network traffic volumes, difficult to realize decision boundaries between attacks and normal activities and highly imbalanced attack class distribution. Moreover, it demands high accuracy, fast processing times and adaptability to a changing environment. We present the results and analysis of two classifier systems (XCS and UCS) on a subset of a publicly available benchmark intrusion detection dataset which features serious class imbalances and two very rare classes. We introduce a better approach for handling the situation when no rules match an input on the test set and recommend this be adopted as a standard part of XCS and UCS. We detect little sign of overfitting in XCS but somewhat more in UCS. However, both systems tend to reach near-best performance in very few passes over the training data. We improve the accuracy of these systems with several modifications and point out aspects that can further enhance their performance. We also compare their performance with other machine learning algorithms and conclude that LCSs are a competitive approach to intrusion detection.
CustomTV System & Demonstration
Authors: J. Cosmas, Y. Paker, A. Pearmain, P. Schoonjans, R. Schafer, A. Erk, C. Dosch, R. Mies, M. Bais, R. Schafer, P. Stammnitz, W. Liebsch, G. Klunsoyr, L. Pedersen, S. Bauer, A. Engelsberg, B. Klock
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The television industy is currently undergoing changes with historic proportions, posing tremendous challenges and opportunities. This is fuelled by the proliferation of new delivery channels to consumers, new capabilities of these channels to carry a multitude of data in addition to conventional video/audio programmes and the need to fill these channels with content.CustomTV is addressing the crucial problem of how, in the near future, viewers will be coping with the proliferation of TV channels as well as navigating through the masses of multimedia information that is likely to be broadcast, thanks to digital technology, alongside with the conventional TVprogrammes.
The Design of a Multimodal Platform: Experimentation of Record & Replay
Authors: Antoine Bouyer, Florent Chuffart, Lionel Courval
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

This article presents the design and a user experimentation of a multimodal service based on an experimental multimodal platform. It describes the technical realization of the platform and the development of a multimodal service. Lastly, it presents the results of an experimentation with users applying this service. These results show that users prefer multimodal interactions and are more efficient with this kind of interface.
A fuzzy optimization approach for variation aware power minimization during gate sizing
Authors: V. Mahalingam, Nagarajan Ranganathan, Justin E. Harlow
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Technology scaling in the nanometer era has increased the transistor's susceptibility to process variations. The effects of such variations are having a huge impact on the yield of the integrated circuits and need to be considered early in the design flow. Traditional corner based deterministic methods are no longer effective and circuit optimization methods require reinvention with a statistical perspective. In this paper, we propose a new gate sizing algorithm using fuzzy linear programming in which the uncertainty due to process variations is modeled using fuzzy numbers. The variations in gate delay which is a function of the gate sizes and the fan-outs of tbe gates are represented using triangular fuzzy numbers with linear membership functions. Initially, as a preprocessing step for fuzzy optimization, we perform deterministic optimizations by fixing the fuzzy parameters to the worst and the average case values, the results of which are used to convert the fuzzy optimization problem into a crisp nonlinear problem. The crisp problem witb delay and power as constraints is then formulated to maximize the robustness, i.e., the variation resistance of the circuit. The fuzzy optimization approach was tested on ITC'99 benchmark circuits and the results were validated for timing yield using Monte Carlo simulations. The proposed approach is shown to achieve better power reduction than the worst case deterministic optimization as well as the stochastic programming based gate sizing methods, while having comparable runtimes.
Evolving an infrastructure for student global software development projects: lessons for industry
Authors: Olly Gotel, Vidya Kulkarni, Des Phal, Moniphal Say, Christelle Scharff, Thanwadee Sunetnanta
Venue: Proceedings of the 2nd India software engineering conference (2009)

With the rapid increase in offshore outsourcing of software development, Global Software Development (GSD) has become the need of the hour. Today's information technology, in the form of communication networks and tooling opportunities, provides us with a supposedly ready infrastructure to support GSD. However, selecting an appropriate combination of tools that cross cultural boundaries and account for unique in-country connectivity situations is not a trivial task. In this paper, we describe our experience of evolving an infrastructure for student GSD projects over a period of four years, culminating in an environment to accommodate the needs of five different teams from four globally dispersed universities in countries straddling many technological divides. We suggest that our experience offers lessons that can also support those organizations embarking upon GSD initiatives and with their own infrastructure decisions to make.
Embeddability Problems for Upward Planar Digraphs
Authors: Francesco Giordano, Giuseppe Liotta, Sue H. Whitesides
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

We study two embedding problems for upward planar digraphs. Both problems arise in the context of drawing sequences of upward planar digraphs having the same set of vertices, where the location of each vertex is to remain the same for all the drawings of the graphs. We develop a method, based on the notion of book embedding, that gives characterization results for embeddability as well as testing and drawing algorithms.
High Quality Video on MultiMedia PCs
Authors: A. Pelagotti, G. de Haan
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Displaying broadcast video on a MultiMedia PC, implies the use of video format conversion (VFC) techniques, as computer displays and television receivers use quite distinct scanning rasters. VFC consists of spatial scaling, de-interlacing and picture rate conversion. Although scaling is rather straightforward, the other two tasks are far from trivial, and advanced motion compensated interpolation techniques are necessary to achieve a performance level that can compete with that of a standard TV. This paper discusses the options for picture rate conversion, and shows how even advanced motion compensated algorithms can run real time on a currently available programmable device.
Secrets of Figure Creation with Poser 7: Advanced development techniques
Authors: Sean Cannon, B.L. Render
Venue:  (2007)

Poser is a popular and affordable 3D character design and animation tool from e frontier (formerly Curious Labs) which sells for just $269.99/169.99. It allows users to import 3D figures people, animals and so on then manipulate them into whatever poses or animations they like with the click of a few buttons. The characters, clothes and props included with the package are limited, however, and many experienced users prefer to create their own to use or sell on to others. Our book offers these experienced users an in-depth guide to creating new content to a professional standard. Practical sections for each chapter are included on the free CD in which the concepts are put to use in examples tutorials, with all the files readers need to follow along. The CD is also packed with numerous utility programs for to use in creating figures.Finally, there is an invaluable trouble-shooting knowledge base included the CD for any problems and bugs that may occur in each stage, so readers are fully equipped to use this package professionally.* Written by two professional Poser masters* Completely restructured to make it a clearer reference guide and far easier to work through step by step* Features professional tips, tricks and workflow techniques illustrated with sample projects and color illustrations
Visual perception skills testing: preliminary results
Authors: Andrew Cyrus Smith
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Good visual perception skills are important in the effective manipulation of Tangible User Interfaces. This paper reports on the application of a test set we have developed specifically to quantify the visual perception skills of children when matching a physical object to its flat representation on paper. A pilot evaluation, with two groups of children from differing socio-economic backgrounds, was conducted to quantify their ability to make the mental transformation from tangible objects to the drawings that represent those objects. Our test instrument is described. We found a marked difference between the two groups in their ability to make the transformation.
Reasoning about System-Degradation and Fault-Recovery with Deontic Logic
Authors: Pablo F. Castro, T. S. Maibaum
Venue: Methods, Models and Tools for Fault Tolerance (2009)

In this paper we outline the main characteristics of a deontic logic, which we claim is useful for the modeling of and reasoning about fault-tolerance and related concepts. Towards this goal, we describe a temporal extension of this formalism together with some of its properties. We use two different examples to show how some fault-tolerance concepts (like fault-recovery and system degradation) can be expressed using deontic constructs. The second example demonstrates how contrary-to-duty reasoning (when a secondary obligation arises from the violation of a primary obligation) is applied in fault-tolerant scenarios.
Tensor Product q -Bernstein Bézier Patches
Authors: Çetin Dişibüyük, Halil Oruç
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

In this work we define a new de Casteljau type algorithm, which is in barycentric form, for the q -Bernstein B&eacute;zier curves. We express the intermediate points of the algorithm explicitly in two ways. Furthermore we define tensor product patches, based on this algorithm, depending on two parameters. Degree elevation procedure for the tensor product patch is studied. Finally, the matrix representation of tensor product patch is given and we find the transformation matrix between classical tensor product B&eacute;zier patch and tensor product q -Bernstein B&eacute;zier patch.