ppxscal/embedding_network huggingface dataset:
The Application of the Distributed Genetic Algorithm to the Decision of the Packing in Containers Problem
Authors: Vladimir I. Litvinenko, J. A. Burgher, Alla A. Tkachuk, Vajcheslav J. Gnatjuk
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

In paper the number of experiments on solution of the task of packaging through distributed genetical algorithm are surveyed. The way of coding of the genetical information and ratings of quality of solutions are written in detail. The outcomes of the comparative tests for thedifferent configurations of operators of genetical algorithm, sizes of a population and elitar block are surveyed; the best configurations are detected. The number of experiments on definition of influence of topology of distributed genetical algorithm, number of processors and period of migration on quality of operation of algorithm is given. The output about sufficient efficiency of distributed genetical algorithm at solution of the given type of the tasks is made.
Active Change Notification in Advanced Knowledge Base Servers
Authors: Martin Staudt, Matthias Jarke, Christoph Quix
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

``Intelligent'' behavior of database systems is often seen restricted to comfortable support for query answering (including limited forms of reasoning) and navigating within the stored data. However, active notification for clients about changes in the database is an important requirement for advanced interaction between the database and its client applications. These usually hold (derived) subsets of the database contents under their control. The incremental maintenance of such materialized views is an important open problem. In addition to some necessary changes in the known view maintenance procedures the issue of translating updates through an API and a way for clients to accept such updates have to be defined. We describe the main features of a solution to this problem implemented in the knowledge base server ConceptBase.
Teach Yourself Photoshop 6.0, 1 edition
Authors: Christopher Lumgair
Venue:  (2002)

:If you are a beginner or familiar with earlier versions of Photoshop,you will want to own Teach Yourself Photoshop 6. 0. Both PC and Mac users will benefit from the step-by-step skill-building approach to scanning,retouching,and enhancing images as well as creating Web pages.
Secure role-based workflow models
Authors: Savith Kandala, Ravi Sandhu
Venue: Proceedings of the fifteenth annual working conference on Database and application security (2001)

In this paper we introduce a series of reference models for Secure Role-Based Workflow systems. We build our models over the well-known RBAC96 framework. The RBAC96 model supports the notion of abstract permissions. The nature of permissions is highly dependent upon the implementation details of the system, so we interpret the permissions for a Workflow system in terms of its components such as tasks, instances of the tasks and operations on them like execute, commit, abort etc. With this interpretation, we show that most of the components of RBAC96 still remain intact. The only components that change are the nature of permissions and their assignment to roles. The models are developed using the recently introduced four-layer OM-AM framework (comprising objective, model, architecture and mechanism layers). In this paper, we focus on the top two layers of OM-AM. We systematically describe our security objectives and construct our models to address these objectives. We also formally describe the models in terms of their components and their interactions. The main purpose for proposing these models is to articulate requirements for building Secure Role-Based Workflow Systems.
A DAta-Parallel Programming Library for Education (DAPPLE)
Authors: David Kotz
Venue:  (1994)

In the context of our overall goal to bring the concepts of parallel computing into the undergraduate curriculum, we set out to find a parallel-programming language for student use. To make it accessible to students at all levels, and to be independent of any particular hardware platform, we chose to design our own language, based on a data-parallel model and on C++. The result, DAPPLE, is a C++ class library designed to provide the illusion of a data-parallel programming language on conventional hardware and with conventional compilers. DAPPLE defines Vectors and Matrices as basic classes, with all the usual C++ operators overloaded to provide elementwise arithmetic. In addition, DAPPLE provides typical data-parallel operations like scans, permutations, and reductions. Finally, DAPPLE provides a parallel if-then-else statement to restrict the scope of the above operations to partial vectors or matrices.
Automatic image annotation and retrieval using cross-media relevance models
Authors: J. Jeon, V. Lavrenko, R. Manmatha
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Libraries have traditionally used manual image annotation for indexing and then later retrieving their image collections. However, manual image annotation is an expensive and labor intensive procedure and hence there has been great interest in coming up with automatic ways to retrieve images based on content. Here, we propose an automatic approach to annotating and retrieving images based on a training set of images. We assume that regions in an image can be described using a small vocabulary of blobs. Blobs are generated from image features using clustering. Given a training set of images with annotations, we show that probabilistic models allow us to predict the probability of generating a word given the blobs in an image. This may be used to automatically annotate and retrieve images given a word as a query. We show that relevance models allow us to derive these probabilities in a natural way. Experiments show that the annotation performance of this cross-media relevance model is almost six times as good (in terms of mean precision) than a model based on word-blob co-occurrence model and twice as good as a state of the art model derived from machine translation. Our approach shows the usefulness of using formal information retrieval models for the task of image annotation and retrieval.
Meta-QoS Performance of Earliest-Deadline-First and Rate-Monotonic Scheduling of Smoothed Video Data in a Client-Server Environment
Authors: Kelvin Yiu-Lun Tsoi, Yu-Kwong Kwok
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

In this paper we present an extensive performance study of two modified EDF and RM scheduling algorithms which are enhanced to provide quality of service (QoS) guarantees for smoothed video data. With a probabilistic definition of QoS, we incorporate admission control conditions into the two algorithms. Furthermore, we also include a counter-based scheduling module as the core scheduling mechanism which adaptively adjusts the actual QoS levels assigned to requests. Our theoretical analysis of the two enhanced algorithms, called QEDF and QRM, shows that the QRM algorithm is more robust than the QEDF algorithm for different workload and utilization conditions. We also propose to use a new metric called meta-QoS to quantify the overall performance of a packet scheduler given a set of simultaneous requests. In our experiments, we find that the QRM algorithm can sustain a rather stable level of meta-QoS even when the workload and utilization levels are increased. On the other hand, the QEDF algorithm is found to be less desirable for a high level of utilization and a large number of requests.
Method Partitioning - Runtime Customization of Pervasive Programs without Design-time Application Knowledge
Authors: Dong Zhou, Santosh Pande, Karsten Schwan
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Method Partitioning is a dynamic technique for customizingperformance-critical message-based interactions betweenprogram components, at runtime and without the need fordesign-time application knowledge. The technique partitionsprogram units that implement message handling, with lowcosts and high levels of flexibility. It consists of (a) staticanalysis of a message handling method to produce candidatepartitioning plans for the method, (b) cost models forevaluating the cost/benefits of different partitioning plans, (c)a Remote Continuation mechanism that "connects" thedistributed parts of a partitioned method at runtime, and (d)Runtime Profiling and Reconfiguration which monitors actualcosts of candidate plans and dynamically selects "best" plansfrom candidates. Experiments with prototypicalimplementation of Method Partitioning in the JEChodistributed event system demonstrate significant performanceimprovements for both communication-bound and compute-intensiveapplications, with both applications having dynamicfactors that are not predictable at design time.
Penalized approximation of the vibration frequencies of a fluid in a cavity
Authors: Daniele Boffi, Claudia Chinosi, Lucia Gastaldi
Venue:  (1999)

Here we point out some difficulties arising in the approximation of the vibration frequencies of a fluid in a cavity in the case of non convex polygonal domains. Since the eigensolutions must satisfy an irrotationality condition, a classical way to face the problem is to consider a penalized formulation. Unfortunately standard conforming finite elements fail to give good results. We intend to justify this failure and to suggest a finite element method based on a reduced integration strategy able to give reasonable results. EMAIL:: boffi@dimat.unipv.it KEYWORDS:: Fluid-structure interaction, eigenvalue problems, finite elements
The effect of noise on a class of energy-based learning rules
Authors: A. Bazzani, D. Remondini, N. Intrator, G. C. Castellani
Venue: Neural Computation (2003)

We study the selectivity properties of neurons based on BCM and kurtosis energy functions in a general case of noisy high-dimensional input space. The proposed approach, which is used for characterization of the stable states, can be generalized to a whole class of energy functions. We characterize the critical noise levels beyond which the selectivity is destroyed. We also perform a quantitative analysis of such transitions, which shows interesting dependency on data set size. We observe that the robustness to noise of the BCM neuron (Bienenstock, Cooper, & Munro, 1982; Intrator & Cooper, 1992) increases as a function of dimensionality. We explicitly compute the separability limit of BCM and kurtosis learning rules in the case of a bimodal input distribution. Numerical simulations show a stronger robustness of the BCM rule for practical data set size when compared with kurtosis.
Application of the extended EFG method and cohesive crack model to the crack growth analysis of concrete structures
Authors: J. Jaśkowiec, C. Cichoń
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

In the paper coupling of the Element Free Galerkin Method with Fictitious Crack Model in analysis of cracks growth in concrete plain structure is presented. The displacement fields is approximated by the extended approximation of moving weighted least square approximation. The special discontinuous enriching functions is constructed to cope with the propagation of the crack. The nonlinear set of incremental equations is formulated and solved by Newton-Raphson procedure.
PARIS: A Parallel Inference System
Authors: S. M. Harabagiu, D. I. Moldovan
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper presents an inferential system based on abductive interpretation of text. Inference to the best explanation is performed by the recognition of the most economic semantic paths produced by the propagation of markers on a very large linguistic knowledge base. The propagation of markers is controlled by their intrinsic propagation rules, devised from plausible semantic relation chains. An interpretation is inferred whenever two markers collide. Using a very large knowledge base, our inferential system aims at producing interpretations accountable for common-sense reasoning. The novelty is that the inference rules model a large variety of implications, as suggested by the knowledge base relations. Textual implicatures are recognized as pragmatic inferences.
Improving Data Freshness in Lazy Master Schemes
Authors: Esther Pacitti, Eric Simon, Rubens Melo
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

Many distributed database applications need to replicate data to improve data availability and query response time. The two-phase-commit protocol guarantees mutual consistency of replicated data but does not provide good performance. Lazy replication has been used as an alternative solution in several types of applications such as on-line financial transactions and telecommunication systems. In this case, mutual consistency is relaxed and the concept of freshness is used to measure the deviation between replica copies. We propose two update propagation strategies that improve freshness. Both of them use immediate propagation: updates to a primary copy are propagated towards a slave node as soon as they are detected at the master node without waiting for the commitment of the update transaction. We study the behavior of our strategies and show that they improve data freshness with respect to the deferred approach.
Comprehensive Evaluation of an Instruction Reissue Mechanism
Authors: T. Sato, I. Arita
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

In this paper, we evaluate a mechanism to reissue instructionson the mispredicted speculation path. An instruction which is once dispatched to a functional unit during mispredicted speculation is issued again inside an instruction window. This scheme is called instruction reissue. We propose to extend register update unit to perform the instruction reissue. The instruction reissue is effective for data dependence speculation, since instructions which are independent of a misspeculated instruction should not besquashed. From an experimental evaluation, we have confirmed that the instruction reissue using the proposed mechanism enhances processor performance without introducing any severe hardware overheads.
Data Dissemination Approaches for Performance Discovery in Grid Computing Systems
Authors: Muthucumaru Maheswaran
Venue: Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2 (2001)

A Grid system can be considered as an infrastructure that allows location independent access to the resources and services that are provided by geographically distributed machines and networks. One fundamental operation necessary to support such a system is performance discovery in wide-area networks. Dissemination of resource status information is an important component of any performance discovery algorithm. The data dissemination for performancediscovery in Grid systems has several distinct features and requirements that can be exploited to make the process efficient. Recently, several data dissemination algorithms based on a new concept called the "Grid potential" were proposed. This paper introduces a new algorithm for data dissemination and compares it with previously introduced schemes through simulation studies. The results indicate that the new algorithm further improves the performance of data dissemination.
Using a progressive withdrawal procedure to study superconnectivity in digraphs
Authors: I. Pelayo, X. Marcote, C. Balbuena, J. Fàbrega
Venue: Discrete Mathematics (2003)

A maximally connected digraph is said to be superconnected if every minimum disconnecting set F of vertices is trivial, that is, it consists of the vertices adjacent to or from a given vertex not belonging to F. This work is devoted to presenting a sufficient condition on the diameter- in terms of a so called parameter l1 (which is related with the number of shortest paths)--in order to guarantee that the digraph is superconnected. We give also a lower bound for the supercounectivity parameter k1, defined as the minimum order of a nontrivial disconnecting set of vertices. This result has been achieved with the help of a 'progressive withdrawal procedure' that establishes how far away a vertex can be to or from a given set of vertices. An analogous result is presented in terms of edges, assuring edge-superconnectivity and giving a lower bound for the parameter λ1.
Star Unfolding of a Polytope with Applications
Authors: K P Agarwal, Boris Aronov, Joseph O''Rourke, A C Schevon
Venue:  (1993)

\def\poly{{\cal P}} We define the notion of a {\em star unfolding} of the surface $\poly$ of a convex polytope with $n$ vertices, and use it to solve several problems related to shortest paths on $\poly$. The first algorithm computes the edge sequences traversed by shortest paths on $\poly$ in time $O(n^6 \beta (n) \log n)$, where $\beta (n)$ is an extremely slowly-growing function. A much simpler $O(n^6)$ time algorithm that finds a small superset of all such edge sequences is also sketched. Second, we describe an $O(n^{8}\log n)$ time procedure for computing the {\em geodesic diameter} of $\poly$: the maximum possible separation of two points on $\poly$, with the distance measured along~$\poly$. Finally, we describe an algorithm that preprocesses $P$ into a data structure that can efficiently answer the queries of the form: ``Given two points, what is the length of the shortest path connecting them?'''' Given a parameter $n^2 \le s \le n^4$, it can preprocess $\poly$, in time $O(n^4 s^{1+\delta})$ for any $\delta < 0$, into a data structure of size $O(n^4s^{1+\delta})$, so that a query can be answered in time $O(\frac{n}{s^{1/4}} \log^2 n)$. If one query point always lies on an edge of $\poly$, the algorithm can be improved to use $O(n^3 s^{1+\delta})$ preprocessing time and storage and guarantee $O(\frac{n}{s^{1/3}} \log^2 n)$ query time for $n^2 \le s \le n^3$.
Dynamics in Transition Mental Activity
Authors: Milton Corrêa, Rosa Viccari, Helder Coelho
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

The scene is set now for computer modelers to take over and highlight the shape and accessibility of the reactive mental sites. Until recently, attempts to model artificial agents had to take account of every functional unit in every architecture.The dynamics of mental states events is crucial to design agents because we need to rethink the role of mental states when tuning behaviours. Tiny changes to the shapes of these states make a big difference to what agents do, and only by inspecting how states interact we may find the most suitable structures and mechanisms for the mental activities.The paper presents how dynamics in transition mental states to agents' behaviour results from a set of properties and laws governing combinations of mental states. These agents can have mental states (beliefs, desires, intentions, expectations) and the activities ot these mental states occur in the context of an agent architecture. This architecture, called SEM (Society of Mental States), is a nest of four sub-agents built around beliefs, desires, intentions and expectations.The characteristics of such agents are defined from the beginning as a basic set of desires, expectations, actions and beliefs, which is also made of strategies to interact with other agents and the world, as well. The interactions of such agents are the result of their mental states' dynamics and their actions, as we show in the paper. Namely, in order to have a pair of agents with tutor and learner behaviours it is only necessary to specify their mental states.
Oracle9i JDeveloper Handbook, 1 edition
Authors: Peter Koletzke, Paul Dorsey, Avrom Faderman
Venue:  (2002)

:From the exclusive publisher of Oracle Press books comes this thorough guide to Oracle's Java development tool, JDeveloper  new for 9i. This book explains the JDeveloper IDE and how to build JSPs, Java applications, business components for Java (BC4J), and more.
Traffic Dispersion and Its Impact on ATM Protocol Functions
Authors: Eva Gustafsson, Gunnar Karlsson
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

Traffic dispersion, which means spreading traffic from a source over multiple disjoint paths through a network, has gained interest for the handling of bursty multimedia traffic. The strategy has been shown to improve network performance and to increase security and tolerance to faults. Our study focuses on the implementation of the technique in an ATM network, and discusses the protocol functions and signaling procedures necessary to support traffic dispersion. These include connection establishment and release for multiple paths, and the dispersion of cells at the sender with resequencing at the receiver. There are also simulation results included to show how dispersion affects the delay a cell suffers through a network. Lastly, we give an example of pseudocode for implementing resequencing and decoding of dispersed cells in a receiving AAL.
Trade of a problem-solving task
Authors: Shigeo Matsubara
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the search problem is difficult to solve, a contractor may fail to find a solution. Here, the more computational resources, such as the CPU time, the contractor invests in solving the search problem, the more likely a solution will be found. This brings about a new problem in which a contractee has to find an appropriate quality level in task achievement as well as to efficiently allocate a task among contractors. For example, if the contractee asks the contractor to find a solution with certainty, the payment from the contractee to the contractor may exceed the contractee's benefit from obtaining a solution, which discourages the contractee from trading a task. However, it is difficult to solve this problem because the contractee cannot ascertain the contractor's problem-solving ability such as the amount of available resources and knowledge (e.g. algorithms, heuristics) nor monitor how many resources are actually invested in solving the allocated task. To solve this problem, we propose a task allocation mechanism that is able to choose an appropriate quality level in task achievement and prove that this mechanism guarantees that each contractor reveals its true information. Moreover, we show that our mechanism can increase the contractee's utility compared with a simple auction mechanism by using computer simulations.
Making Use of JSP, 1 edition
Authors: Madhushree Ganguli
Venue:  (2002)

:Web developers and designers are bringing new life to the Web by using JavaServer Pages (JSP) to create and maintain dynamic content that leverages existing business systems. This powerful technology lets you change the overall Web page layout without altering the underlying content by separating the user interface from content generation. Following an innovative, task-based approach, this book will quickly show you how to develop these information-rich Web pages with JSP. As you progress through each chapter and complete the exercises, you gain the essential skills necessary for working with this technology. You also learn how to rapidly develop Webbased applications that are platform independent, and uncover the advantages of choosing JSP over other Web scripting languages such as ColdFusion and PHP. 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