ppxscal/embedding_network huggingface dataset:
Correlation Model for 3D Texture
Authors: Kristin J. Dana, Shree K. Nayar
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

While an exact definition of texture is somewhat elusive, texture can be qualitatively described as a distribution of color, albedo or local normal on a surface. In the literature, the word texture is often used to describe a color or albedo variation on a smooth surface. We refer to such texture as 2D texture.In real world scenes, texture is often due to surface height variations and can be termed 3D texture. Because of local foreshortening and masking, oblique views of 3D texture are not simple transformations of the frontal view. Consequently, texture representations such as the correlation function or power spectrum are also affected by local foreshortening and masking.This work presents a correlation model for a particular class of 3D textures. The model characterizes the spatial relationship among neighboring pixels in an image of 3D texture and the change of this spatial relationship with viewing direction.
How to Use Lotus Notes 6
Authors: Jane Calabria, Dorothy Burke
Venue:  (2003)

:About the Author:Jane Calabria has also authored many books for Que and Sams. She is a speaker and trainer for Lotus Notes and Domino and conducts national training sessions and seminars. Jane is co-author of the Professional Developer's Guide to Domino and is a Certified Lotus Notes Professional (CLP). Dorothy Burke is a Certified Lotus Notes Instructor (CLI) and Certified Lotus Notes Professional (CLP). She teaches Domino system administration and application development, as well as Lotus Notes basics. She has been a consultant and trainer since 1988 and has contributed to several Que and Sams books.
Structured Control of Parallel Tracing
Authors: Cherri M. Pancake
Venue:  (1991)

Structured programming techniques have provided the scientific programmer with a way to make source code structure reflect underlying design logic. Tracing tools, however, typically provide only crude mechanisms for establishing which portions of a parallel program should be monitored and what kind of information should be reported. This report describes mechanisms which improve the situation by allowing programmers to control the number and type of run-time events in a structured fashion that reflects their conceptual models of program behavior. Although the mechanisms were designed to improve tracing facilities, they also can be applied effectively to interactive debuggers. The advantages of the approach derive from its clear relationship to program structure. The model for specifying trace output matches that used for code, so it is easier for the programmer to come up with a useful trace. Since events are grouped into levels according to common needs during the program life-cycle, the number of unnecessary event records is reduced as well, making trace interpretation faster and less frustrating.
Counting Circular Arc Intersections
Authors: K P Agarwal, Micha Sharir
Venue:  (1991)

\indent In this paper we present efficient algorithms for counting intersections in a collection of circles or circular arcs. We present a randomized algorithm to count intersections in a collection of $n$ circles whose expected running time is $O(n^{3/2+\epsilon})$, for any $\epsilon < 0.$ We also develop another randomized algorithm to count intersections in a set of $n$ circular arcs whose expected running time is $O(n^{5/3+\epsilon})$, for any $\epsilon < 0.$ If all arcs have the same radius, the (expected) running time can be improved to $O(n^{3/2+\epsilon})$, for any $\epsilon < 0$.
Complexity of Finitely Presented Algebras
Authors: Dexter Kozen
Venue:  (1976)

An algebra $\cal A$ is finitely presented if there is a finite set G of generator symbols, a finite set O of operator symbols, and a finite set $\Gamma$ of defining relations $x \equiv y$ where $x$ and $y$ are well-formed terms over G and O, such that $\cal A$ is isomorphic to the free algebra on G and O modulo the congruence induced by $\Gamma$. The uniform word problem, the finiteness problem, the triviality problem (whether $\cal A$ is the one element algebra), and the subalgebra membership problem (whether a given element of $\cal A$ is contained in a finitely generated subalgebra of $\cal A$) for finitely presented algebras are shown to be $\leq^{m}_{\log}$-complete for P. The schema satisfiability problem and schema validity problem are shown to be $\leq^{m}_{\log}$-complete for NP and co-NP, respectively, Finally, the problem of isomorphism of finitely presented algebras is shown to be polynomial time many-one equivalent to the problem of graph isomorphism.
A case study on social network in a computer game
Authors: Yang Cao, Golha Sharifi, Yamini Upadrashta, Julita Vassileva
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper argues for the importance of considering interpersonal relationships emerging among the users of multi-user applications, and demonstrates the usefulness of a multi-agent system underlying a specially designed multi-player games to investigate emerging user attitudes towards each other.
Steady State Solution of MRSPN with Mixed Preemption Policies
Authors: Miklos Telek, Andrea Bobbio, Antonio Puliafito
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

Markov Regenerative Stochastic Petri Nets (MRSPN) have been recently recognized as a valuable tool to model systems with non-exponential timed activities. The usual assumption in the implementation of such models is that at most a single non-exponential transition, with associated enabling memory policy, can be enabled in each marking. More recently, new memory policies have been studied in order to represent more complex and effective preemption mechanisms in real systems. Closed-form solutions in the Laplace transform domain have been provided also in this case. This paper concentrates on the steady-state analysis of MRSPN and provides an unified analytical approach to include mixed memory policies into a single model. A numerical example concludes the paper.
An inverse problem of the three-dimensional wave equation for a general annular vibrating membrane with piecewise smooth boundary conditions
Authors: E. M. E. Zayed
Venue: The Korean Journal of Computational Applied Mathematics (2003)

This paper deals with the very interesting problem about the influence of piecewise smooth boundary conditions on the distribution of the eigenvalues of the negative Laplacian in R3. The asymptotic expansion of the trace of the wave operator μ(t) = Σv=1∞ exp (-itµv1/2) for small |t| and i = √-1, where {µv}v=1∞ are the eigenvalues of the negative Laplacian -∇2 = -Σk=13 (∂/∂xk)2 in the (x1, x2, x3)-space, is studied for an annular vibrating membrane Ω in R3 together with its smooth inner boundary surface S1 and its smooth outer boundary surface S2. In the present paper, a finite number of Dirichlet, Neumann and Robin boundary conditions on the piecewise smooth components Si*(i = 1,...,m) of S1 and on the piecewise smooth components Si* (i = m + 1, ..., n) of S2 such that S1 = ∪i=1m Si* and S2 = ∪i=m+1n Si* are considered. The basic problem is to extract information on the geometry of the annular vibrating membrane Ω from complete knowledge of its eigenvalues by analyzing the asymptotic expansions of the spectral function μf(t) for small |t|.
Evolutionary dynamics of a food web with recursive branching and extinction
Authors: Hiroshi Ito, Takashi Ikegami
Venue: Proceedings of the eighth international conference on Artificial life (2002)

A dynamic systems approach to evolutionary branching and its development in an artificial food web is presented. Predator-prey interaction among trophic species with two traits generates a variety of evolutionary branching patterns, depending on interaction strengths and mutation rates. Studying branching patterns in a phenotypic space reveals three branching patterns: prey-bifurcation, predator-bifurcation, and net-bifurcation. In particular, a complex food web network emerges through net-bifurcation. A relationship between biomass and the number of species is analysed by changing the interaction strength. We report that the branching and extinction rates of trophic species reaches a maximum when the number of species, but not the entire biomass, reaches a maximum.
Visual Simulation of Snowfall, Snow Cover and Snowmelt
Authors: Kazunobu Muraoka, Norishige Chiba
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Creation of seasonal scenery images by computer graphics is an attractive theme with many problems to be solved. This paper presents a method of expressing snow to create natural scenery image in winter. We describe a method of automatically creating the behavior of snowflakes in a field of air currents with respect to snowfall, a method of automatically creating shapes of snow accumulation by using virtual temperature as a parameter with respect to snow cover formed just after snowfall, and a method based on heat propagation simulation taking into account sunlight, ground heat, and radiation heat from objects with respect to snowmelt. This paper furthermore presents an image creation method to express the feel of the material of snowfall and snow cover.
Implementation and Evaluation of Autonomous Decentralized System Based Mobile Communications Platform for ITS Services
Authors: Masashi Hiraiwa, Takeiki Aizono, Akitoshi Shimura
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

The development of a mobile network to provide intelligent transport systems (ITS) services is underway as a national project of Japan called the "Smart Gateway" responding to nationwide needs for such a network. System issues for implementation include the necessity of measures for phased system expansion and for efficient system maintenance. In addition, a data transmission method must be established to provide uninterrupted communication across microcells following the radio signal environment changes to deliver information to fast-moving vehicles. To cope with these issues, this system uses an autonomous decentralized systemarchitecture and supports online extendibility, online maintainability and fault tolerance that are critical to set up a system that operates non-stop. Thus, the authors developed a microcell mobility management to enable uninterrupted communication across microcells. The authors developed a prototype incorporating the above methods and made an evaluation.
Sams Teach Yourself Windows Game Programming with DirectX in 21 Days
Authors: Clayton Walnum
Venue:  (2002)

:In just 21 days, you'll learn all the skills you need to build games and more with Direct3D, one of DirectX's graphics libaries, in your 2D game programs. Direct3D is not just for 3D game programming! With a little know-how, you can use it to create any kind of graphically based program you want. As you learn about using Direct3D for 2D programs, you'll discover how to handle bitmaps, animation, sound, and much more. More importantly, you'll learn to create an old-style role-playing game, along the lines of the early Ultima games, and you'll do it all without page after page of complicated math!
A proposal for an architectural approach which apparently solves all known software-based internal computer security problems
Authors: Richard LeRoy Routh
Venue: ACM SIGOPS Operating Systems Review (1984)

Computer security violations have become a serious threat to both corporate and national defense activities. By extending the work done by Myers et. el. in the development of the capability based addressing system for the SWARD at IBM, a Computer architectural approach has been developed which solves all known software based internal computer security problems. The problems solved include (but are not restricted to):(1) Violations of priority and access priveleges by highly skilled users,(2) The clasic "Trojan Horse" problem,(3) Access and alteration of sensitive data-bases by unauthorized users(4) The "Lost Key" problem of advanced capability based addressing systems.This solution proposes and develops an architectural approach which manages a sophisticated capability based addressing system entirely in hardware. As a result, the architectures developed by this approach tend to be somewhat hardware intensive in that they require unusual amounts of control and memory not available to any user (it is maintained soley for security purposes).
Enabling Alarm Correlation for a Mobile Agent Based System and Network Management - A Wrapper Concept
Authors: Steffen Lipperts
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

Solutions for system and network management given today are afflicted with two main shortcomings, namely the centralized approach they are based on and the inadequate addressing of heterogeneous environments.While the latter is the main concern of e.g. web based management activities, the aspect of centralization is not being covered to full extend. With regard to the explosive growth of computer systems and networks both in size and complexity, new approaches therefore have to be evaluated which address all problems caused by complexity and heterogeneity. Mobile agent technology is being discussed as a promising new technology for various application areas, with management being one of the most promising. In this paper, problems arising when trying to apply this new technology to system and network management are identified and discussed. The focus is on how to handle the overall complexity with mobile agents, which are limited in size, knowledge, and functionality.An architecture will be presented which introduces various types of mobile agents. By determining the required correlation sequence and identifying the co-operation of agents, it is shown how an alarm correlation with mobile agents can be established, which forms the basis for addressing management tasks with mobile agent technology.
Concurrent layered learning
Authors: Shimon Whiteson, Peter Stone
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Hierarchies are powerful tools for decomposing complex control tasks into manageable subtasks. Several hierarchical approaches have been proposed for creating agents that can execute these tasks. Layered learning is such a hierarchical paradigm that relies on learning the various subtasks necessary for achieving the complete high-level goal. Layered learning prescribes training low-level behaviors (those closer to the environmental inputs) prior to high-level behaviors. In past implementations these lower-level behaviors were always frozen before advancing to the next layer. In this paper, we hypothesize that there are situations where layered learning would work better were the lower layers allowed to keep learning concurrently with the training of subsequent layers, an approach we call concurrent layered learning. We identify a situation where concurrent layered learning is beneficial and present detailed empirical results verifying our hypothesis. In particular, we use neuro-evolution to concurrently learn two layers of a layered learning approach to a simulated robotic soccer keepaway task. The main contribution of this paper is evidence that there exist situations where concurrent layered learning outperforms traditional layered learning. Thus, we establish that, when using layered learning, the concurrent training of layers can be an effective option.
Evolutionary Migration of Legacy Systems to an Object-Based Distributed Environment
Authors: Miguel A. Serrano
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

There is an increasing interest in migrating legacy systems to new hardware platforms and to new software development paradigms. High maintenance costs and lack of documentation are among the challenges facing software engineers who wish to migrate such systems. The increasing emphasis on distributed systems and on the object-oriented paradigm suggests that object-oriented, component-based, distributed systems will represent a significant portion of the next generation of software systems. We present a semiautomatic, evolutionary migration methodology for legacy systems which produces an object-based distributed system. We use ISA which is a design recovery and subsystem classification technique that produces a data-cohesive hierarchical subsystem decomposition of the subject system. We adapt the subsystems to the object-oriented paradigm. We wrap and define interfaces of the subsystems in order to define components. Components are allocated to multiple sites. Finally, middleware technologies for distributed systems are used to implement the communication between components. The approach is suitable for the evolutionary migration of legacy systems since each component can be reengineered separately.
Web Site Analysis: Structure and Evolution
Authors: Filippo Ricca, Paolo Tonella
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

Web sites are becoming important assets for several companies, which need to incorporate sophisticated technologies into complex and large web based systems. Therefore, methodologies and tools are required for their design, implementation and maintenance. In particular, the possibility for a site to evolve to provide updated and accessible information is a fundamental need.In this paper, web sites are considered the object of several analyses, focused on their structure and their history, with the purpose of supporting maintenance activities. Structural information may help understanding the organization of the pages in the site, while history analysis provides indications on modifications that do not correspond to the original design or that produce undesirable effects.A tool was developed to implement the analysis of web site structure and evolution. Its application to some examples downloaded from the Web highlights several areas where the extracted information can improve the control on the maintenance phase and provide valuable support.
Algorithms for Parallel Memory II: Hierarchical Multilevel Memories
Authors: Scott J Vitter, A E M Shriver.
Venue:  (1993)

In this paper we introduce parallel versions of two hierarchical memory models and give optimal algorithms in these models for sorting, FFT, and matrix multiplication. In our parallel models, there are $P$ memory hierarchies operating simultaneously; communication among the hierarchies takes place at a base memory level. Our optimal sorting algorithm is randomized and is based upon the probabilistic partitioning technique developed in the companion paper for optimal disk sorting is a two-level memory with parallel block transfer. The probability of using $\ell$ times the optimal running time is exponentially small in $\ell$(log $\ell$)log $P$.
Excel for Chemists: A Comprehensive Guide, 2 edition
Authors: E. Joseph Billo
Venue:  (2002)

:Chemists across all subdisciplines use Excel to record data in tabular form, but few have learned to take full advantage of the scientific calculating power within this program. Excel is capable of helping chemists process, analyze, and present scientific data, from the relatively simple to the highly complex. Excel(r) for Chemists, Second Edition has been revised and updated, not only to take into account the changes that were made in Excel, but also to incorporate an abundance of new examples.Arranged in a user-friendly format, this book contains illustrations and examples of chemical applications, useful "How to" boxes outlining how to accomplish complex tasks in Excel, and step-by-step instructions for programming Excel to automate repetitive data-processing tasks. In addition, tips are provided to speed, simplify, and improve your use of Excel. Included is a CD-ROM, usable in either Macintosh or IBM/Windows environments with many helpful spreadsheet templates, macros, and other tools.Entirely new chapters contained in this Second Edition feature:* Array formulas covered in depth in a separate chapter, along with a comprehensive review of using arrays in VBA* How to create a worksheet with controls, such as option buttons, check boxes, or a list box* An extensive list of shortcut keys-over 250 for Macintosh or PC-is provided in the appendixWhether as a text for students or as a reference for chemical professionals in industry, academia, or government, Excel(r) for Chemists, Second Edition provides a valuable resource for using Excel to manage various chemical calculations. 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
Practical Real-Time Approaches for Scheduling VBR Video in a Client-Server Computing Environment
Authors: Kelvin Yiu-Lun Tsoi, Yu-Kwong Kwok
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

Scheduling of multiple variable-bit-rate (VBR) video packet streams at the server is one of the most crucial issue in the design of a enterprise video-on-demand (VoD) system. Scheduling is important to guarantee the requested QoS levels while maximizing the utilization of the resources. But the scheduling problem is difficult due to the inherent varying resource requirements of the video streams.Although much work on smoothing and scheduling algorithms has been done, these previous techniques, which usually require the knowledge of future frame sizes and are of a high time complexity, are not suitable because in the video application environment envisioned in our study, real-time response from the server is required.In this paper, we propose and evaluate four real-time approaches using real MPEG data. Our results reveal that the proposed real-time techniques introduce only a slight jitter effect on the video display. Furthermore, time-division based algorithms are superior to rate based ones.
Rate models for conductance-based cortical neuronal networks
Authors: Oren Shriki, David Hansel, Haim Sompolinsky
Venue: Neural Computation (2003)

Population rate models provide powerful tools for investigating the principles that underlie the cooperative function of large neuronal systems. However, biophysical interpretations of these models have been ambiguous. Hence, their applicability to real neuronal systems and their experimental validation have been severely limited. In this work, we show that conductance-based models of large cortical neuronal networks can be described by simplified rate models, provided that the network state does not possess a high degree of synchrony. We first derive a precise mapping between the parameters of the rate equations and those of the conductance-based network models for time-independent inputs. This mapping is based on the assumption that the effect of increasing the cell's input conductance on its f-I curve is mainly subtractive. This assumption is confirmed by a single compartment Hodgkin-Huxley type model with a transient potassium A-current. This approach is applied to the study of a network model of a hypercolumn in primary visual cortex. We also explore extensions of the rate model to the dynamic domain by studying the firing-rate response of our conductance-based neuron to time-dependent noisy inputs. We show that the dynamics of this response can be approximated by a time-dependent second-order differential equation. This phenomenological single-cell rate model is used to calculate the response of a conductance-based network to time-dependent inputs.