ppxscal/embedding_network huggingface dataset:
Dynamic relationship between diversity and plasticity of cell types in multi-cellular state
Authors: Hiroaki Takagi, Kinihiko Kaneko
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Dynamics maintaining diversity of cell types in a multicellular system are studied in relationship with the plasticity of cellular states. First, we introduce a new theoretical framework, reaction-diffusion system on 'chemical species space' to model intra-cellular chemical reaction dynamics. Then, by considering the cell division and death of such cells, developmental process from a single cell is studied. Cell differentiation process is found to occur through instability in transient dynamics and cell-cell interaction. In a long time behavior, extinction of multiple cells is repeated, which leads to itinerancy over successive quasi-stable multi-cellular states consisting of different types of cells. By defining the plasticity of a cellular state, it is shown that the plasticity of cells decrease before the large extinction, from which diversity and plasticity are recovered. After this switching, decrease of plasticity again occurs, leading to the next extinction of multiple cells. This cycle of diversification and extinction is repeated. Relevance of our results to the development and evolution is briefly discussed.
Linearization in parallel pCRL
Authors: Jan F Groote, Alban Ponse, Yaroslav S. Usenko
Venue:  (2000)

We describe a linearization algorithm for parallel pCRL processes similar to the one implemented in the linearizer of the \mcrl\ Toolset. This algorithm finds its roots in formal language theory: the `grammar'' defining a process is transformed into a variant of Greibach Normal Form. Next, any such form is further reduced to \emph{linear form}, i.e., to an equation that resembles a right-linear, data-parametric grammar. We aim at proving the correctness of this linearization algorithm. To this end we define an equivalence relation on recursive specifications in \mcrl\ that is model independent and does not involve an explicit notion of solution.
On-Line Convex Planarity Testing
Authors: Giuseppe D Battista, Roberto Tamassia, Luca Vismara
Venue:  (1995)

An important class of planar straight-line drawings of graphs are the convex drawings, in which all faces are drawn as convex polygons. A graph is said to be convex planar if it admits a convex drawing. We consider the problem of testing convex planarity in a semi-dynamic environment, where a graph is subject to on-line insertions of vertices and edges. We present on-line algorithms for convex planarity testing with the following performance, where $n$ denotes the number of vertices of the graph: convex planarity testing and insertion of vertices take $O(1)$ worst-case time, insertion of edges takes $O(\log n)$ amortized time, and the space requirement of the data structure is $O(n)$. Furthermore, we give a new combinatorial characterization of convex planar graphs.
Object-Oriented Animation on the World Wide Web
Authors: Patrick Cai, Azer Bestavros
Venue:  (1995)

Abstract We propose that video/audio animation be considered as a first-class object on the World Wide Web. Animation is a very "bandwidth-efficient" alternative to using video streams, especially for presentations involving mathematical objects and interactions. We present an object-oriented model that supports drawing-based and frame-based animation. Based on that model, we describe an extension of the HyperText Markup Language to support these capabilities. BU-NCSA Mosanim, a modified version of the NCSA Mosaic for X(v2.5), was developed and is available for distribution via anonymous FTP to demonstrate the concepts and potentials of animation in presentations and interactive game playing over the web.
Exploring Video Structure Beyond The Shots
Authors: Yong Rui, Thomas S. Huang, Sharad Mehrotra
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

While existing shot-based video analysis approaches provide users with better access to the video than the raw data stream does, they are still not sufficient for meaningful video browsing and retrieval, since:(1.) the shots in a long video are still too many to be presented to the user; (2) shots do not capture the underlying semantic structure of the video, based on which the user may wish to browse/retrieve the video. To explore video structure at a semantic level, this paper presents an effective approach for video scene structure construction, in which shots are grouped into semantic-related scenes. The output of the proposed algorithm provides a structured video that greatly facilitates user's access. Experiments based on real-world movie videos validate the effectiveness of the proposed approach.
An Efficient Color-Spatial Indexing and Retrieval Scheme for Image Database
Authors: Timothy K. Shih, Ching-Sheng Wang, Anthony Y. Chang, Chuan-Ho Kao, Hsiao-Rong Tyan
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

This paper presents a new method of retrieving images from an image database. We combine both color and spatial features of a picture to index and measure the similarity of images. Several color spaces that widely used in computer graphic were discussed and compared for color clustering. In addition, we propose a new automatic indexing scheme of image database according to our clustering method, which could filter the image efficiently. As a technical contribution, a Seed-Filling like algorithm that could extract the shape and spatial relationship feature of image is proposed. In addition, the system is incorporated with a visual interface, which allows the user to specify objects as the spatial specification of pictures. Our experience shows that the system is able to retrieve image information efficiently by proposed color-spatial approach.
On Godefroid's Stateless Search Technique for Testing Concurrent Programs
Authors: Kuo-Chung Tai, Bengi Karacali
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Godefroid developed a state space exploration technique that does not store states in memory. This stateless search technique is effective for testing concurrent programs. It performs deterministic executions of a concurrent program by automatically controlling the execution of synchronization operations. This technique also uses partial order reduction methods to reduce the chance of executing two or more different totally-ordered paths with the same partial order. In this paper, we propose extensions to Godefroid's technique and compare it with other stateless search techniques for testing concurrent programs. Our empirical results indicate that a combination of stateless search and a simple cycle prediction method is very cost-effective for detecting deadlocks and violations of assertions.
Mission-Critical Security Planner: When Hackers Won't Take No For an Amswer, 1 edition
Authors: Eric Greenberg
Venue:  (2002)

:Let's face it: Security is a business problem, not just a technical challenge. Whether hackers simply want to test their skills or steal your data, they can -- and will -- do incalculable damage to your company. You need a solid plan. The good news is that Eric Greenberg has done most of the planning work for you. This isn't just an "I told you so" book. You get hands-on involvement from the start. You'll see your own customized security plan template begin to take shape as you complete the accompanying worksheets. Choose any one of the security plans outlined in this book, and you will be able to protect your data and deter hackers. And by implementing the proven strategies Greenberg details, you can secure your company's competitive edge for the long term. 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
The Analyses, Perspectives and Problems of Artificial Neural Networks Development
Authors: Yuriy A. Kravchenko
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This article gives the analyses of artificial neural networks application, displays the problems of neuro-control development. It considers the perspectives of hybrid networks creation. 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
Single-Electronics - How It Works. How It's Used. How It's Simulated
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

How it works: A short and simple introduction to the underlying physics of single electronics is given. Relevant energies, charging, tunneling and Coulomb blockade are explained with simple concepts and analogies. How it's used: An overview of possible applications is given. A focus is put on the most promising ones such as memories and applications in metrology. We also mention open challenges such as random background charge fluctuations and manufacturing methods. How it's simulated: Three simulation methods, Monte Carlo, Master Equation and Spice macro-models, are introduced and compared. We touch on appropriate random number generators, variance reducing methods and make comparison to measurements.
AppleScript 1-2-3
Authors: Sal M. Soghoian
Venue:  (2003)

:You could be saving yourself time and money right now using tools you probably didn't even know you had. AppleScript, a powerful and free scripting tool included on every Macintosh, enables individuals, professionals, and businesses to save time and money by automating time-consuming, repetitive tasks. Hallmark, for example, used AppleScript to reduce the number of color proofs needed to create a greeting card from a range of 5 to 25 expensive proofs per card down to just two. The best part? You don't need a degree in engineering to create powerful, results-driven scripts. In AppleScript 1-2-3 Apple's AppleScript product manager, Sal Soghoian, teaches beginners how to address nearly any automation task on the Macintosh. Broken down into three parts, the book starts by explaining AppleScript fundamentals through a series of hands-on how-tos designed to teach you how to write functional scripts. The second section expands on the knowledge gained in the first section with an in-depth examination of useful AppleScript tools and techniques, and the third section uses sample scripts to demonstrate how to automate Apple and third-party applications. If you're looking to work more productively by automating your workflow, you'll want this primer written by the leading expert in the field-no one knows more about AppleScript than Sal. 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
Closed-Form Expressions for Other-Cell Interference in Cellular CDMA
Authors: Philip J. Fleming, Burt Simon, Alexander Stolyar
Venue:  (1997)

We investigate the ratio of other-cell interference to in-cell interference in cellular CDMA. This ratio appears in expressions for the capacity of the system when "mobiles" are distributed as a (spatial) Poisson process (as in [2]), but must be evaluated by numerical integration when the positions of the "base stations" are fixed (e.g. a hexagonal grid). Our model is identical to [2] except that we distribute both the mobiles and base stations as Poisson processes. Each mobile is power controlled by the "best" base station (least signal attenuation) of the N closest base stations. We present closed form expressions when N = 1,2 and infinity which are very simple when N = 1 and infinity. We argue that the performance (system capacity) predicted by our model is pessimistic since a real system has a more regular arrangement of base stations than a typical Poisson process. However, our simple closed-form expressions yield values that do not differ significantly from the (optimistic) values found in [1], where a regular hexagonal arrangement of base stations is assumed.
Minimal term rewriting systems
Authors: H. R. Walters, Jasper F.T Kamperman
Venue:  (1995)

Formally well-founded compilation techniques for Term Rewriting Systems (TRSs) are presented. TRSs are compiled into Minimal Term Rewriting Systems (MTRSs), a subclass of TRSs in which all rules have an extremely simple form. A notion of simulation of (rewrite) relations is presented, under which an MTRSs can be said to simulate a TRS. The MTRS rules can be directly interpreted as instructions for an extremely simple Abstract Rewriting Machine (ARM). Favourable practical results have already been obtained with an earlier version of ARM.
Reengineering Object-Oriented Code
Authors: Richard Fanta, Václav Rajlich
Venue: Proceedings of the International Conference on Software Maintenance (1998)

In this paper, we describe the reengineering of a deteriorated object-oriented industrial program written in C++. The main problem of the program was misplaced code, most often functions that were members of the wrong class. In order to deal with this problem, we designed and implemented several restructuring tools and used them in specific reengineering scenarios. We also discuss how this set of tools could be enhanced in the future, and the importance of restructuring for object-oriented software maintenance.
Priority Inheritance Spin Locks for Multiprocessor Real-Time Systems
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

When a real-time system is realized on a shared-memory multiprocessor, priority-ordered spin locks are often required to reduce priority inversions. However, simple priority-ordered spin locks can cause uncontrolled priority inversions when they are used for nested spin locks. This paper points out the problem of uncontrolled priority inversions in the context of spin locks and proposes priority inheritance spin locks, spin lock algorithms that are enhanced with the priority inheritance scheme, to solve the problem. Two algorithms of priority inheritance spin locks are presented and their effectiveness is demonstrated through performance measurements.
Brokering Based Self Organizing E-Service Communities
Authors: Sumi Helal, Mei Wang, Arun Jagatheesan, Raja Krithivasan
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

The rapid evolution of the Internet and its business tools is enabling the transformation and deployment of business processes as highly modular e-services that can be flexibly and dynamically composed to form ad-hoc workflow. This research prepares for the proliferation of automated, Internet-based workflow, by contributing a suite of protocols for self-organizing brokering communities that enables the discovery of relevant e-services. In this paper, we present protocols and architecture for e-service brokering communities, and discuss their use in workbase, an Internet-based, automated workflow system over e-services. The brokering protocols are based on a three-tier architecture of agents, brokers and superbrokers. We also present an infrastructure for dynamically composing new services from exiting e-services on the Internet. An implementation using JKQML of broke ring communities is provided along with the architecture and design of our e-services and workflow concepts.
A comparison of cache aware and cache oblivious static search trees using program instrumentation
Authors: Richard E. Ladner, Ray Fortna, Bao-Hoang Nguyen
Venue: Experimental algorithmics: from algorithm design to robust and efficient software (2002)

An experimental comparison of cache aware and cache oblivious static search tree algorithms is presented. Both cache aware and cache oblivious algorithms outperform classic binary search on large data sets because of their better utilization of cache memory. Cache aware algorithms with implicit pointers perform best overall, but cache oblivious algorithms do almost as well and do not have to be tuned to the memory block size as cache aware algorithms require. Program instrumentation techniques are used to compare the cache misses and instruction counts for implementations of these algorithms.
A novel mobile agent search algorithm
Authors: W.-S. E. Chen, C.-W. R. Leng, Yao-Nan Lien
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Intelligent agents have been shown to be a good approach to addressing the issues of limited capacity and unreliable wireless links in mobile computing. However, before the approach can be commercially viable, a set of management capabilities that support the controls of intelligent agents in a mobile environment need to be in place. Since controls can only be applied after the target agent is located, an effective agent search algorithm is an indispensable part of the management functions. In this paper, we propose a new algorithm, the highest probability first algorithm, for locating the target agent. The approach makes use of the execution time information to reduce cost and network traffic. The execution time of the agent on a server is assumed to be binomial distributed and therefore is more realistic.
A Formal Verication Environment for Railway Signaling System Design
Authors: Cinzia Bernadeschi, Alessandro Fantechi, Stefania Gnesi, Salvatore Larosa, Giorgio Mongardi, Dario Romano
Venue:  (1995)

A fundamental problem in the design and development of embedded control systems is the verification of safety requirements. Formal methods, offering a mathematical way to specify and analyze the behavior of a system, together with the related support tools can successfully be applied in the formal proof that a system is safe. However, the complexity of real systems is such that automated tools often fail to formally validate such systems. This paper outlines an experience on formal specification and verication carried out in a pilot project aiming at the validation of a railway computer based interlocking system. Both the specifi cation and the verification phases were carried out in the JACK (Just Another Concurrency Kit) integrated environment. The formal specification of the system was done by means of process algebra terms. The formal verification of the safety requirements was done first by giving a logical specification of such safety requirements, and then by means of model checking algorithms. Ab- straction techniques were defined to make the problem of safety requirements validation tractable by the JACK environment. EMAIL:: gnesi@iei.pi.cnr.it
Relativistic Theory of Polarization and Magnetization Due to an Electromagnetic Field, Part 2: Field Induced Axial and Circular Birefringence
Authors: M. W. Evans
Venue:  (1991)

The relativistic theory is considered of field induced circular and axial birefringence measured in the observer frame with a source receding near the velocity of light. Use of the Lorentz transformation in the Maxwell equation leads to the following results: 1) Natural optical activity is amplified in the Y axis by the factor (c + vz)/(c vz), where v is the velocity of the source; 2) There is no Y axis relativistic amplication (R.A.) of the first order Faraday and Wagniere/Meier effects; 3) There is an R.A. of the second order Faraday and Wagniere/Meier effects; 4) Effects in the X and Y axes become inequivalent in the observer frame.
A Reliable Statistical Admission Control Strategy for Interactive Video-On-Demand Servers with Interval Caching
Authors: Sun-Euy Kim, Chita R. Das
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

An admission control algorithm is a key component of a video server that supports quality of service (QoS). Such an algorithm determines whether a new request can be admitted to the server without compromising the required performance of the in-service users. All prior admission control policies for video servers have focused on improving the underlying storage system utilization such that a VOD server can accept more requests while satisfying the QoS requirements. In this paper, we examine admission control for an interactive video server that uses a resource sharing mechanism, called interval caching. The primary motivation of this work is to develop an efficient admission policy to optimize the server throughput with acceptable QoS.We analyze four admission control algorithms, called deterministic, predictive, statistical average, and reliable statistical admission control (RSAC), for an interactive video server and find that the proposed RSAC scheme is quite efficient compared to the other three schemes in terms of throughput and jitter. The RSAC policy attempts to optimize the disk and cache utilization while reserving a certain amount of disk bandwidth for streams that are evicted from the cache, and are likely to cause jitter due to unavailable disk space. We estimate this reserved disk bandwidth as a function of the average number of cached steams, which in turn indicates improvement in server capacity with interval caching. The average number of cached streams and the subsequent reserved bandwidth are computed using a simple, yet accurate mathematical model. Extensive performance evaluation indicates that the RSAC is an attractive scheme for an interactive or non-interactive video server and can be implemented with other performance enhancement techniques.
SmNdMin: a program for modeling the Nd isotopic evolution of metamorphic porphyroblasts and their host rocks
Authors: Jerry F. Magloughlin, Lawrence Edwards
Venue: Computers Geosciences (2003)

The purpose of SmNdMin is to investigate a possible source of error inherent, and often ignored, in geochronologic data where metamorphic porphyroblasts and their host rock (as opposed to whole rock) have been chemically and isotopically analyzed. The program is customized for the Sm-Nd geochronometer and to accommodate garnet analyses where Nd and Sm compositional data are available, but may be used for similar geochronometers and similar hostmineral relationships. Minimally, garnet core, garnet rim, and host-rock analyses are needed for Sm concentration, Nd concentration, and 143Nd/144Nd. In addition, a modal estimate of the minerals of interest is necessary, and a second mineral, such as monazite, may be considered.The program evaluates the path of the host rock on a plot of time versus 143Nd/144Nd as it deviates as a result of the growth of one or two minerals. This effect can produce severe errors in estimates of the initiation and duration of porphyroblast growth especially when the volume fraction of the primary mineral of interest is large, and when other minerals, rich in the elements of interest (e.g., Nd and Sm), sequesters a large fraction of these elements and thus, in effect, changes the bulk chemistry. A text file used by the program can be easily modified by the user and contains all of the parameters needed in the calculations. A batch file to install the program on the user's hard drive is included, or the program may be run directly from diskette.