ppxscal/embedding_network huggingface dataset:
Hierarchical Identity Based Encryption with Polynomially Many Levels
Authors: Craig Gentry, Shai Halevi
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

We present the first hierarchical identity based encryption (HIBE) system that has full security for more than a constant number of levels. In all prior HIBE systems in the literature, the security reductions suffered from exponential degradation in the depth of the hierarchy, so these systems were only proven fully secure for identity hierarchies of constant depth. (For deep hierarchies, previous work could only prove the weaker notion of selective-ID security.) In contrast, we offer a tight proof of security, regardless of the number of levels; hence our system is secure for polynomially many levels.Our result can very roughly be viewed as an application of Boyen's framework for constructing HIBE systems from exponent-inversion IBE systems to a (dramatically souped-up) version of Gentry's IBE system, which has a tight reduction. In more detail, we first describe a generic transformation from "identity based broadcast encryption with key randomization" (KR-IBBE) to a HIBE, and then construct KR-IBBE by modifying a recent construction of IBBE of Gentry and Waters, which is itself an extension of Gentry's IBE system. Our hardness assumption is similar to that underlying Gentry's IBE system.
VOVO: VCR-Oriented Video-on-Demand in Large-Scale Peer-to-Peer Networks
Authors: Yuan He, Yunhao Liu
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

Most P2P Video-On-Demand (VOD) schemes mainly focus more on mending service architectures and optimizing overlays but do not carefully consider the user behavior and the benefit of prefetching strategies. As a result, they cannot better support VCR-oriented services in terms of substantive asynchronous clients, and free VCR controls for P2P VODs. In this paper, we propose VOVO, VCR-oriented VOD for large-scale P2P networks. By mining associations inside a video, the segments requested in VCR interactivities are accurately predicted based on the information collected through gossips. Together with a hybrid caching strategy, a collaborative prefetching scheme is proposed to optimize resource distribution among neighboring peers. We evaluate VOVO through extensive experiments. Results show that VOVO is scalable and effective, providing short startup latencies and good performance in VCR interactivities.
Online Improved Eigen Tracking
Authors: Subarna Tripathi, Santanu Chaudhury, Sumantra Dutta Roy
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

We present a novel predictive statistical framework to improve the performance of an Eigen Tracker which uses fast and efficient eigen space updates to learn new views of the object being tracked on the fly using candid co-variance free incremental PCA. The proposed system detects and tracks an object in the scene by learning the appearance model of the object online motivated by non-traditional uniform norm. It speeds up the tracker many fold by avoiding nonlinear optimization generally used in the literature.
Conjoint analysis for IPTV service
Authors: Jiwoong Song, Taewon Jang, So Young Sohn
Venue: Expert Systems with Applications: An International Journal (2009)

Given the upcoming introduction of IPTV service in Korea, it is necessary to develop business models and marketing strategies to improve customer satisfaction and succeed in market competition. We use conjoint analysis to estimate customer preferences and the relative importance of service factors. Based on results from total customers' and clustered customers' service preferences, we propose marketing strategies for service providers.
Learning weighted linguistic fuzzy rules by using specifically-tailored hybrid estimation of distribution algorithms
Authors: Luis delaOssa, José A. Gámez, José M. Puerta
Venue: International Journal of Approximate Reasoning (2009)

The WCOR methodology makes use of metaheuristic algorithms to find the best set of rules, as well as their weights, when learning weighted linguistic fuzzy systems from data. Although in early work based on this approach the search was carried out by means of a genetic algorithm, any other technique can be used. Estimation of distribution algorithms (EDAs) are a family of evolutionary algorithms in which the variation operator consists of a probability distribution that is learnt from the best individuals in a population and sampled to generate new ones. There are several possibilities for including problem domain knowledge in EDAs in order to make the search more efficient. In particular, this study examines specifically-designed EDAs which incorporate the information available about the WCOR problem into the probabilistic graphical model used to factorize the probability distribution. The experiments carried out with real and artificial datasets show an improvement in both the results obtained and the computational effort required by the search process.
Broadband Multimedia Information Service for European Parliaments
Authors: Karsten Morisse, Francisco Cortes, Reinhard Luling
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper presents a distributed broadband multimedia information service that is realised within the project EPRI-COM that is supported by the European Union within the ACTS program. The primary idea of the EPRI-COM information service is to provide in-depth information from the Europen parliament to the parliamentarians of Central and Eastern Europe supporting the integration process of these countries in the EU in this way.The technical basis of the EPRI-COM project is a novel network of media servers providing audio/video streams of high quality to a number of widely distributed clients. The server network and the EPRI-COM information service is managed by a distributed server management system presented in this paper. In the current phase of the EPRI-COM project, six parliaments of Central and Eastern Europe as well as the European parliament are connected to the EPRI-COM service.
Cutoff wave numbers for energy-orthogonal six-node triangular plane-strain elements
Authors: Francisco José Brito Castro
Venue: Computers and Structures (2009)

This paper studies the propagation of plane harmonic waves in unbounded media discretized by the standard six-node triangular finite element. The element stiffness matrix is split into basic and higher order components which are obtained from mean and deviatoric strain fields, respectively. This decomposition is applied to the elastic energy. Based on the properties of the higher order energy, two values of the wave number are selected. Depending on the desired precision one of those values can be used as optimum cutoff wave number to properly capture a wave field.
Security kernels
Authors: Steven B. Lipner, William A. Wulf, Roger R. Schell, Gerald J. Popek, Peter G. Neumann, Clark Weissman
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Recent experience in computer security has illustrated the susceptibility of numerous operating systems to hostile penetration. Successful penetrations have been directed at manufacturers' conventional operating systems as well as special "secure" versions that have been the subjects of exhaustive efforts to find and fix all potential security problems. While formal reports are understandably hard to come by, it appears that the effort required to "break" any operating system and obtain access to any information it stores (at any time and without detection) is in the range two to four man-months. In contrast, the effort expended in futile attempts to prevent such penetration may be as much as two orders of magnitude greater (several man-years or more).
Estimating aggregates in time-constrained approximate queries in Oracle
Authors: Ying Hu, Seema Sundara, Jagannathan Srinivasan
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

The concept of time-constrained SQL queries was introduced to address the problem of long-running SQL queries. A key approach adopted for supporting time-constrained SQL queries is to use sampling to reduce the amount of data that needs to be processed, thereby allowing completion of the query in the specified time constraint. However, sampling does make the query results approximate and hence requires the system to estimate the values of the expressions (especially aggregates) occurring in the select list. Thus, coming up with estimates for aggregates is crucial for time-constrained approximate SQL queries to be useful, which is the focus of this paper. Specifically, we address the problem of estimating commonly occurring aggregates (namely, SUM, COUNT, AVG, MEDIAN, MIN, and MAX) in time-constrained approximate queries. We give both point and interval estimates for SUM, COUNT, AVG, and MEDIAN using Bernoulli sampling for various type of queries, including join processing with cross product sampling. For MIN (MAX), we give the confidence level that the proportion 100&gamma;% of the population will exceed the MIN (or be less than the MAX) obtained from the sampled data.
Application of the trace assertion method to the specification, design, and verification of automaton programs
Authors: E. V. Kuzmin, V. A. Sokolov, D. Ju. Chalyy
Venue: Programming and Computing Software (2009)

The paper considers the application of the trace assertion method [1] for specification and verification of automaton programs [2---4]. The trace assertion method allows the programmer to define an externally visible behavior of an automaton program in a rigorous way, without considering details of its implementation. The method is employed at the requirements specification stage of the system development. The paper introduces techniques for defining semantics of some elements of an automaton program, especially those involved in interactions with the control system. A formal approach to defining states of automaton programs is described. Results of studies related to the verification of specification requirements for automaton programs are also presented.
Multi-Replication with Intelligent Staging in Data-Intensive Grid Applications
Authors: Yuya Machida, Shin'ichiro Takizawa, Hidemoto Nakada, Satoshi Matsuoka
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

Existing data grid scheduling systems handle huge data I/O via replica location services coupled with simple staging, decoupled from scheduling of computing tasks. However, when the application/workflow scales, we observe considerable degradations in performance, compared to processing within a tightly-coupled cluster. For example, when numerous nodes access the same set of files simultaneously, major performance degradation occurs even if replicas are used, due to bottlenecks that manifest in the infrastructure. Instead of resorting to expensive solutions such as parallel file systems, we propose alleviating the situation by tightly coupling replica and data transfer management with computation scheduling. In particular we propose three techniques: (1) dynamic aggregation and O(1) replication of data-staging requests across multiple nodes using a multi-replication framework, (2) replica-centric scheduling - data re-use and time-to-replication as compute scheduling metrics on the grid and (3) overlapped execution of data staging and compute bound tasks. Early benchmark results implemented in our prototype Condor-like grid scheduling system demonstrate that the techniques are quite effective in eliminating much of the overhead in data transfers in many cases.
Online control of a batch processor with incompatible job families under correlated future arrivals
Authors: John Benedict C. Tajan, Appa Iyer Sivakumar, Stanley B. Gershwin
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The oxidation and diffusion ovens in wafer fabrication are batch processors, where only jobs belonging to identical job families can be processed together. In this paper, we compare the performance of a proposed online heuristic based on Model Predictive Control against a popular look-ahead method called NACHM. Simulation results show that the MPC-based heuristic, with properly selected parameters, can have up to 16.67% shorter mean cycle time than NACHM under uncorrelated job arrivals. Under positively correlated job arrivals, the mean cycle time of jobs passing through the batch processor is almost always significantly reduced for both the MPC-based policy and NACHM. The simulation results also suggest that increased correlation generates less improvement for policies that foresee events longer into the future, as NACHM improves at a faster rate than the MPC-based heuristic. Thus, when the correlation is sufficiently high (0.7) and the traffic intensity is low (0.5), the MPC-based heuristic, which considers events that occur farther into the future, has higher mean cycle time (from 1.92% to 9.47%) than NACHM. Controlling processors in front of the batch processor with the anticipated needs of the batch processor, successive job arrivals to the batch processor may result in positively correlated job families. Our results highlight the potential benefits of constraining the production of the upstream processor according to the anticipated needs of the batch processor.
Issues About Retinex Theory and Contrast Enhancement
Authors: Marcelo Bertalmío, Vicent Caselles, Edoardo Provenzi
Venue: International Journal of Computer Vision (2009)

We present an interpretation of Land's Retinex theory that we show to be consistent with the original formulation. The proposed model relies on the computation of the expectation value of a suitable random variable weighted with a kernel function, thus the name Kernel-Based Retinex (KBR) for the corresponding algorithm. KBR shares the same intrinsic characteristics of the original Retinex: it can reduce the effect of a color cast and enhance details in low-key images but, since it can only increase pixel intensities, it is not able to enhance over-exposed pictures. Comparing the analytical structure of KBR with that of a recent variational model of color image enhancement, we are able to perform an analysis of the action of KBR on contrast, showing the need to anti-symmetrize its equation in order to produce a two-sided contrast modification, able to enhance both under and over-exposed pictures. The anti-symmetrized KBR equations show clear correspondences with other existing color correction models, in particular ACE, whose relationship with Retinex has always been difficult to clarify. Finally, from an image processing point of view, we mention that both KBR and its antisymmetric version are free from the chromatic noise due to the use of paths in the original Retinex implementation and that they can be suitably approximated in order to reduce their computational complexity from $\mathcal{O}(N^{2})$ to $\mathcal{O}(N\log N)$ , being N the number of input pixels.
Light warping for enhanced surface depiction
Authors: Romain Vergne, Romain Pacanowski, Pascal Barla, Xavier Granier, Christophe Schlick
Venue: ACM Transactions on Graphics (TOG) (2009)

Recent research on the human visual system shows that our perception of object shape relies in part on compression and stretching of the reflected lighting environment onto its surface. We use this property to enhance the shape depiction of 3D objects by locally warping the environment lighting around main surface features. Contrary to previous work, which require specific illumination, material characteristics and/or stylization choices, our approach enhances surface shape without impairing the desired appearance. Thanks to our novel local shape descriptor, salient surface features are explicitly extracted in a view-dependent fashion at various scales without the need of any pre-process. We demonstrate our system on a variety of rendering settings, using object materials ranging from diffuse to glossy, to mirror or refractive, with direct or global illumination, and providing styles that range from photorealistic to non-photorealistic. The warping itself is very fast to compute on modern graphics hardware, enabling real-time performance in direct illumination scenarios. Note: Third-Party Material Attribution Third-party material used in ACM Transactions on Graphics 28(3), Article 25 - "Light Warping for Enhanced Surface Depiction," by Vergne, Pacanowski, Barla, Granier, and Schlick - was used without proper attribution. The 3D model used in Figures 1, 3, and 5, as well as in the cover image of this volume of the journal, was downloaded from the Shape Repository of AIM@SHAPE Project (http://shapes.aimatshape.net) and is the property of CNR-IMATI. We regret this oversight.
Get Out of I.T. While You Can.: A GUIDE TO EXCELLENCE FOR PEOPLE IN I.T., 0 edition
Authors: Craig Schiefelbein
Venue:  (2007)

Advance praise for Get Out of I.T. While You Can. This simple message eludes many in this world. Our job is to support the businessif people dont get this, success is impossible. Mike Jones, CIO, Childrens Hospital Craigs book is really about leadership. He articulates a key thought process that drives great leaders at all levels of successful organizations. Dirk Debbink, president, MSI General Craigs message is universal. Anyone in any department (not just IT) can benefit from this message. And it applies to private sector and public sectors equally. The more we understand Craigs message in the public sector, the more we can focus on the true business of government. Matt Miszewski, CIO, State of Wisconsin Craigs message inspires all employees to realize their role in driving organizational success. A must-hear message for all! Betty Barhorst, president, Madison Area Technical College Getting out of IT and into your industry is what it takes to be great in IT. Great message! Mark Henderson, section head, technical support services, Mayo Clinic Everyone in IT can benefit from this message. It will get them, their IT organization, their company, and the real customer to a better place. Judy Murphy, vice president information services, Aurora Healthcare
Reachability Problems on Directed Graphs
Authors: Robert E. Tarjan
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

I will present recent work and open problems on two directed graph reachability problems, one dynamic, one static. The dynamic problem is to detect the creation of a cycle in a directed graph as arcs are added. Much progress has been made recently on this problem, but intriguing questions remain. The static problem is to compute dominators and related information on a flowgraph. This problem has been solved, but the solution is complicated, and there are related problems that are not so well understood. The work to be discussed is by colleagues, other researchers, and the speaker.
A Two-by-Two Mixed Reality System That Merges Real and Virtual Worlds in Both Audio and Visual Senses
Authors: Kyota Higa, Takanobu Nishiura, Asako Kimura, Fumihisa Shibata, Hideyuki Tamura
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

There have been many implementations of virtual reality, using audio and visual senses. However, implementations of mixed reality (MR) have thus far only dealt with the visual sense. We have developed an MR system that merges real and virtual worlds in both the audio and visual senses, wherein the geometric consistency of the audio sense was fully coordinated with the visual sense. We tried two approaches for merging real and virtual worlds in the audio sense, using open-air and closed-air headphones.
Feature Selection Algorithm for Multiple Classifier Systems: A Hybrid Approach
Authors: Pawel Delimata, Zbigniew Suraj
Venue: Fundamenta Informaticae (2008)

Many problems in pattern classification and knowledge discovery require a selection of a subset of attributes or features to represent the patterns to be classified. The approach presented in this paper is designed mostly for multiple classifier systems with homogeneous (identical) classifiers. Such systems require many different subsets of the data set. The problem of finding the best subsets of a given feature set is of exponential complexity. The main aim of this paper is to present ways to improve RBFS algorithm which is a feature selection algorithm. RBFS algorithm is computationally quite complex because it uses all decision-relative reducts of a given decision table. In order to increase its speed, we propose a new algorithm called ARS algorithm. The task of this algorithm is to decrease the number of the decision-relative reducts for a decision table. Experiments have shown that ARS has greatly improved the execution time of the RBFS algorithm. A small loss on the classification accuracy of the multiple classifier used on the subset created by this algorithm has also been observed. To improve classification accuracy the simplified version of the bagging algorithm has been applied. Algorithms have been tested on some benchmarks.
Experimental evaluation of temporal and energy characteristics of an outdoor sensor network
Authors: Marco Zennaro, Hervé Ntareme, Antoine Bagula
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

This paper revisits the link quality issue in Wireless Sensor Networks (WSN) by studying the temporal and energy characteristics of a 2, 4Ghz sensor network in an outdoor environment. Using different values of output power and sampling period, we analyze battery behavior in motes placed at different distances and show that farther motes have a shorter battery life. Our experimental results suggest that when deployed in real world deployments, the sampling periods of sensor networks be adjusted according to distance to normalize battery lifetime and a more accurate energy-aware routing protocol be developed.
Software product quality assurance
Authors: John R. Ryan
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

Providing clear objectives, guidelines, and requirements in an environment conducive to high productivity is absolutely essential to designing and producing high-quality software. The Software Quality Branch of the Computer Systems Division of Texas Instruments is tasked with providing support functions that are vital to producing high-quality software. This paper explains the role of the Software Quality Branch in administering the development methodology of the Computer Systems Division. The paper also describes our participation in a corporate effort to define and monitor quality indices and our use of a software quality circle to encourage commitment to quality goals and to develop solutions to quality problems.
Users' preferences regarding intelligent user interfaces: differences among users and changes over time
Authors: Anthony Jameson, Silvia Gabrielli, Antti Oulasvirta
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

The goal of this full-day workshop is to arrive at a synthesis of knowledge that will help people who work with intelligent user interfaces to predict and explain how users' attitudes and behavior toward aspects of such systems (a) differ from one user to the next and (b) change over time.