ppxscal/embedding_network huggingface dataset:
Teaching operating systems administration with user mode linux
Authors: Renzo Davoli
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

User Mode Linux is a virtual machine running on a GNU-Linux operating system. It is the right choice for teaching operating systems' administration, as it does not need any dedicated hardware. It runs at user level (no need for root, i.e. administrator, access or possible security threats) and it does not have the performance problems of an emulator. This paper describes how to set up a laboratory for teaching operating systems' administration.
Scalable resilient media streaming
Authors: Suman Banerjee, Seungjoon Lee, Ryan Braud, Bobby Bhattacharjee, Aravind Srinivasan
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

We present a low-overhead media streaming system, called SRMS (Scalable Resilient Media Streaming) that can be used to scalably deliver streaming data to a large group of receivers. SRMS uses overlay multicast for data distribution. to a large group of users. SRMS leverages a probabilistic loss recovery technique to provide high data delivery guarantees even under large network losses and overlay node failures. The clients in the SRMS system are able to interoperate with existing media streaming servers that use RTP for data transport. One of the interesting features of SRMS is that it can simultaneously support clients with disparate access bandwidths. It enables the necessary bandwidth adaptations using standard Real-time Transport Protocol (RTP) mechanisms, e.g. RTP translators. We have implemented and evaluated the SRMS system in detail on an emulated network as well as on a wide-area testbed with up to 128 clients. Our results show that clients using SRMS achieve high (97%) data delivery ratios with low overheads (<5%) even for a very dynamic network (up to five membership changes per minute).
Selecting Appropriate Counter-Measures in an Intrusion Detection Framework
Authors: Frederic Cuppens, Sylvain Gombault, Thierry Sans
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

Since current computer infrastructures are increasingly vulnerable to malicious activities, intrusion detection is necessary but unfortunately not sufficient.We need to design effective response techniques to circumvent intrusions when they are detected. Our approach is based on a library that implements differenttypes of counter-measures. The idea is to design a decision support tool to help the administrator to choose, in this library, the appropriate counter-measure whena given intrusion occurs. For this purpose, we formally define the notion of anti-correlation which is used to determine the counter-measures that are effective to stop the intrusion. Finally, we present a platform of intrusion detection, called DIAMS, that implements the response mechanisms presented in this paper.
On the Integration of Autonomous Data Marts
Authors: Luca Cabibbo, Riccardo Torlone
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

We address the problem of integrating a federation ofdimensional data marts. This problem arises when, e.g., alarge organization (or a federation thereof) needs to combine independently developed data warehouses. We show that this problem can be tackled in a systematic way because of two main reasons. First, data marts are structuredin a rather uniform way, along dimensions and facts. Second, data quality in data marts is usually higher than in generic databases, since they are obtained by reconcilingseveral data sources. Our scenario of reference is a federation (i.e., a logical integration) of various data marts, which we need to query in a unified way, that is, by meansof drill-across operations. We propose a novel notion of dimension compatibility and characterize its general property. We then show the significance of dimension compatibility in performing drill-across queries over autonomousdata marts. We also discuss general strategies for the integration of data marts.
An Interview with George Sadowsky: Casting a wider net
Authors: Ubiquity staff
Venue: Ubiquity (2004)

Internet governance and policy expert George Sadowsky on using information and communication technologies to encourage economic development
Fast Evolution of Image Manifolds and Application to Filtering and Segmentation in 3D Medical Images
Authors: Thomas Deschamps, Ravi Malladi, Igor Ravve
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

In many instances, numerical integration of space-scale PDEs is the most time consuming operation of image processing. This is because the scale step is limited by conditional stability of explicit schemes. In this work, we introduce the unconditionally stable semi-implicit linearized difference scheme that is fashioned after additive operator split (AOS) [1], [2] for Beltrami and the subjective surface computation. The Beltrami flow [3], [4], [5] is one of the most effective denoising algorithms in image processing. For gray-level images, we show that the flow equation can be arranged in an advection-diffusion form, revealing the edge-enhancing properties of this flow. This also suggests the application of AOS method for faster convergence. The subjective surface [6] deals with constructing a perceptually meaningful interpretation from partial image data by mimicking the human visual system. However, initialization of the surface is critical for the final result and its main drawbacks are very slow convergence and the huge number of iterations required. In this paper, we first show that the governing equation for the subjective surface flow can be rearranged in an AOS implementation, providing a near real-time solution to the shape completion problem in 2D and 3D. Then, we devise a new initialization paradigm where we first "condition¿ the viewpoint surface using the Fast-Marching algorithm. We compare the original method with our new algorithm on several examples of real 3D medical images, thus revealing the improvement achieved.
A Novel Approach to Cartoon Style Rendering of an Image with an Approximated Crayon Texture
Authors: Priti Sehgal, P. S. Grover
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

In this paper we present an efficient approach to cartoon style rendering of an image with an approximated crayon texture. The algorithm generates a crayon texture map, with two crayon textures (illuminated color texture and shadowed color texture) combined into one. The crayon texture is generated using crayon stroke generation technique. The texture is then mapped onto the image in cartoon style using per-vertex mapping concept. This algorithm results in an improved transition boundary between the two texture colors, comparable to the normal cartoon shaded image without crayon texture. If the image generated by this algorithm is animated, then the transition boundary would move logically with the object as compared to our earlier algorithm (described in the text), where transition boundary changed drastically with slight movement of an object in the image. The present approach can be used to generate variations in cartoon shading easily and efficiently. We have also attempted to approximate the effect of distribution of wax in the resulting image.
Smoothing Methods for Mathematical Programs with Equilibrium Constraints
Authors: Masao Fukushima, Gui-Hua Lin
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

In the recent optimization world, mathematical programswith equilibrium constraints (MPECs) have been receivingmuch attention and there have been proposed anumber of methods for solving MPECs. In this paper, weprovide a brief review of the recent achievements in theMPEC field and, as further applications of MPECs, we alsomention the developments of the stochastic mathematicalprograms with equilibrium constraints (SMPECs).
On Leveraging User Access Patterns for Topic Specific Crawling
Authors: Charu C. Aggarwal
Venue: Data Mining and Knowledge Discovery (2004)

In recent years, there has been considerable research on constructing crawlers which find resources satisfying specific conditions called predicates. Such a predicate could be a keyword query, a topical query, or some arbitrary contraint on the internal structure of the web page. Several techniques such as focussed crawling and intelligent crawling have recently been proposed for performing the topic specific resource discovery process. All these crawlers are linkage based, since they use the hyperlink behavior in order to perform resource discovery. Recent studies have shown that the topical correlations in hyperlinks are quite noisy and may not always show the consistency necessary for a reliable resource discovery process. In this paper, we will approach the problem of resource discovery from an entirely different perspective; we will mine the significant browsing patterns of world wide web users in order to model the likelihood of web pages belonging to a specified predicate. This user behavior can be mined from the freely available traces of large public domain proxies on the world wide web. For example, proxy caches such as Squid are hierarchical proxies which make their logs publically available. As we shall see in this paper, such traces are a rich source of information which can be mined in order to find the users that are most relevant to the topic of a given crawl. We refer to this technique as collaborative crawling because it mines the collective user experiences in order to find topical resources. Such a strategy turns out to be extremely effective because the topical consistency in world wide web browsing patterns turns out to very high compared to the noisy linkage information. In addition, the user-centered crawling system can be combined with linkage based systems to create an overall system which works more effectively than a system based purely on either user behavior or hyperlinks.
Atomic structure, band offsets, growth and defects at high-K Oxide: Si interfaces
Authors: J. Robertson, P. W. Peacock
Venue: Microelectronic Engineering (2004)

The properties of gate oxides with high dielectric constant are described. The constraints on bonding at Sioxide interfaces are considered in order to obtain an insulating interface. The stabilities of various atomic configurations of interface are compared, and their band offsets are calculated. The energy levels of point defects and of interstitial hydrogen are considered as candidates for the substantial fixed charge present in these oxides.
Combined Dynamic Voltage Scaling and Adaptive Body Biasing for Heterogeneous Distributed Real-time Embedded Systems
Authors: Le Yan, Jiong Luo, Niraj K. Jha
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Dynamic voltage scaling (DVS) is a powerful technique for reducingdynamic power consumption in a computing system. However, astechnology feature size continues to scale, leakage power is increasing and willlimit power savings obtained by DVS alone. Previous system-level real-timescheduling approaches use DVS alone to optimize power consumption withoutconsidering leakage power. To overcome this limitation, we propose a newscheduling algorithm that combines DVS and adaptive body biasing (ABB)to simultaneously optimize both dynamic power consumption and leakagepower consumption for real-time distributed embedded systems. First, wederive an analytical expression to determine the optimal supply voltage andbody bias voltage under a given clock frequency. Based on this expression, wecompute the optimal energy consumption at a given clock frequency and analyzethe tradeoff between energy consumption and execution time for a set oftasks with precedence relationships and real-time constraints. We then proposea scheduling algorithm to reduce total power consumption under givenreal-time constraints. This algorithm also considers variations in power consumptionof different tasks and characteristics of different voltage-scalableprocessing elements (PEs) to maximize power reduction. Experimental resultsshow that the average power reduction of our technique with respect toDVS alone is 34.7%, while the average saving compared to no voltage scalingis 68.3% for the 0.07µm technology.
Simulation and control of ventilation rates in greenhouses
Authors: J. Dayan, E. Dayan, Y. Strassberg, E. Presnov
Venue: Mathematics and Computers in Simulation (2004)

A simple model is presented, which enables the calculation of ventilation in a commercial rose-growing greenhouse (greenhouse). The model represents the greenhouse as three vertically stacked horizontal segments and addresses the energy and vapor transfer among these segments and between them the plant canopy and the external environment. The model equations show how ventilation can be calculated from the heat and vapor balances and how they can describe the internal microclimate. Air exchange rates obtained by the model are similar to published results obtained by tracer experiments and CFD. The model can be updated and calibrated for various conditions and structures, in accordance with online measurements of transpiration, leaf temperature, air temperatures and humidity at several heights above ground level. By making some assumptions, representative plant temperatures (RPTs) can be calculated instead of being measured. The validity of the model assumptions is established by comparing numerical results with experimental data. Good agreement is obtained between the numerical output of the model and the experimental measurements, for most times of the day. The simplified model is used to demonstrate the calculation of representative plant temperatures when forced ventilation is applied to cool the plants. Further study is still necessary to make the model applicable to complete days and throughout the season. Once the model is fully established and proven it will be used for sophisticated greenhouse climate control.
A Metadata Application Profile for Collection-Level Description of Digital Folklore Resources
Authors: Irene Lourdi, Christos Papatheodorou
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The preservation and representation of folklore collections is a basic priority for every country because they are valuable for studying the customs and the tradition of specific groups of people and places. However, for the heterogeneity and diversity of folklore resources (text, images, photographs, 3D objects, sound recordings, maps or even digital material), it is difficult to create a unified and semantically rich description concerning both the collections and their objects. In this paper we introduce an integrated metadata model by mixing elements of different metadata standards in order to make the navigation to the digital collection efficient and to provide the users with rich meaningful information retrieval to collection objects. The model fits with the requirements and the unique characteristics of the folklore collections and is focused on facilitating the retrieval of information to all the structural levels.
Augmented non-quadratic penalty algorithms
Authors: Jean-Pierre Dussault
Venue: Mathematical Programming: Series A and B (2004)

Auslender, Cominetti and Haddou have studied, in the convex case, a new family of penalty/barrier functions. In this paper, we analyze the asymptotic behavior of augmented penalty algorithms using those penalty functions under the usual second order sufficient optimality conditions, and present order of convergence results (superlinear convergence with order of convergence 4/3). Those results are related to the analysis of &#x2018;&#x2018;pure&#x2019;&#x2019; penalty algorithms, as well as &#x2018;&#x2018;augmented&#x2019;&#x2019; penalty using a quadratic penalty function. Limited numerical examples are presented to appreciate the practical impact of this local asymptotic analysis.
Knowledge Sifter: Ontology-Driven Search over Heterogeneous Databases
Authors: L. Kerschberg, M. Chowdhury, A. Damiano, H. Jeong, S. Mitchell, J. Si, S. Smith
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Knowledge Sifter is a scaleable agent-based system thatsupports access to heterogeneous information sources suchas the Web, open-source repositories, XML-databases andthe emerging Semantic Web. User query specification issupported by a user agent that accesses multiple ontologiesusing an integrated conceptual model. A collection ofcooperating agents supports interactive query specification,refinement, decomposition, and processing, as well asresult ranking and presentation. The Knowledge Sifterarchitecture is general and modular so that ontologies andinformation sources can be easily incorporated. A proof-of-concept implementation depicts Knowledge Sifter using a domain ontology together with geo-spatial and semanticname services to enhance query formulation and to searchimage databases such as Lycos and TerraServer.
X-RAY: A Non-Invasive Exclusive Caching Mechanism for RAIDs
Authors: Lakshmi N. Bairavasundaram, Muthian Sivathanu, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
Venue: Proceedings of the 31st annual international symposium on Computer architecture (2004)

RAID storage arrays often possess gigabytes of RAM forcaching disk blocks. Currently, most RAID systems use LRUor LRU-like policies to manage these caches. Since these arraycaches do not recognize the presence of file system buffer caches,they redundantly retain many of the same blocks as those cachedby the file system, thereby wasting precious cache space. In thispaper, we introduce X-RAY, an exclusive RAID array cachingmechanism. X-RAY achieves a high degree of (but not perfect) exclusivitythrough gray-box methods: by observing which files havebeen accessed through updates to file system meta-data, X-RAYconstructs an approximate image of the contents of the file systemcache and uses that information to determine the exclusive set ofblocks that should be cached by the array. We use microbenchmarksto demonstrate that X-RAY's prediction of the file systembuffer cache contents is highly accurate, and trace-based simulationto show that X-RAY considerably outperforms LRU andperforms as well as other more invasive approaches. The mainstrength of the X-RAY approach is that it is easy to deploy - allperformance gains are achieved without changes to the SCSI protocolor the file system above.
Multi-level redundancy optimization in series systems
Authors: Won Young Yun, Jong Woon Kim
Venue: Computers and Industrial Engineering (2004)

Single-level systems have been considered in redundancy allocation problems. It may be the best policy in some specific situations, but not in general. In regards to reliability, it is most effective to duplicate the lowest objects, because parallel-series systems are more reliable than series-parallel systems. However, the smaller an object is, the more time and higher accuracy are needed for duplicating it, and so, redundancy cost can be decreased by using modular redundancy. Therefore, providing redundancy at high levels like as modules or subsystems, can be more economical than providing redundancy at low level of components. In this paper, the problem in which redundancy is available at all levels in a series system is addressed and a mixed integer programming model is presented. A heuristic algorithm and a genetic algorithm are proposed to solve the problem and some examples illustrate the procedure.
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
Authors: Jens Gramm, Jiong Guo, Falk H&#x00fc;ffner, Rolf Niedermeier
Venue: Algorithmica (2004)

We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is twofold&#x2014;rapid development and improved upper bounds. Many search tree algorithms for various problems in the literature are based on complicated case distinctions. Our approach may lead to a much simpler process of developing and analyzing these algorithms. Moreover, using the sheer computing power of machines it may also lead to improved upper bounds on search tree sizes (i.e., faster exact solving algorithms) in comparison with previously developed &#x201c;hand-made&#x201d; search trees. Among others, such an example is given with the NP-complete Cluster Editing problem (also known as Correlation Clustering on complete unweighted graphs), which asks for the minimum number of edge additions and deletions to create a graph which is a disjoint union of cliques. The hand-made search tree for Cluster Editing had worst-case size O(2.27k), which now is improved to O(1.92k) due to our new method. (Herein, k denotes the number of edge modifications allowed.)
Building continuous webbed models for system F
Authors: S. Berardi, C. Berline
Venue: Theoretical Computer Science (2004)

We present here a large family of concrete models for Girard and Reynolds polymorphism (system F), in a noncategorical setting. The family generalizes the construction of the model of Barbanera and Berardi (Tech. Report, University of Turin, 1997), hence it contains complete models for Fη (A βη-complete model for system F, preprint, June, 1998) and we conjecture that it contains models which are complete for F. It also contains simpler models, the simplest of them, E2, being a second-order variant of the Engeler-Plotkin model E. All the models here belong to the continuous semantics and have underlying prime algebraic domains, all have the maximum number of polymorphic maps. The class contains models which can be viewed as two intertwined compatible webbed models of untyped λ-calculus (in the sense of Berline (From computations to foundations: the λ-calculus and its webbed models, revised version, Theoret. Comput. Sci. 86 pp., to appear)), but it is much larger than this. Finally, many of its models might he read as two intertwined strict intersection type systems.
Business Design for an On Demand Business Enterprise
Authors: Hong Cai, LiHua Tang, Ying Huang
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Today, enterprises are faced with the challenge of better aligning the IT investment with their strategic direction. This is especially true for CIOs of the enterprises. In this paper, we propose the concept of Business Design Integration that is a systematic approach to vertically integrate a number of Business Design related activities, ranging from strategy formulation, business redesign, to the redesign of operations environment. It also provides better communication mechanisms for different roles surrounding the CIOs. Role based analysis is critical for our study of Business Design Integration in this paper. To illustrate how to realize the proposed approach, we introduce the prototype of Business Design Portal as a tool to facilitate the communication amongst people responsible for various aspects of Business Design. The approach and associated concepts, prototype tools and methods proposed in this paper could be useful for on demand business transformation in scenarios such as Business Transformation Outsourcing (BTO) and Business Process Outsourcing (BPO).