ppxscal/embedding_network huggingface dataset:
Proving BDI Properties of Agent-Oriented Programming Languages
Authors: Rafael H. Bordini, álvaro F. Moreira
Venue: Annals of Mathematics and Artificial Intelligence (2004)

In this paper, we consider each of the nine BDI principles defined by Rao and Georgeff based on Bratman's asymmetry thesis, and we verify which ones are satisfied by Rao's AgentSpeak(L), a logic programming language inspired by the BDI architecture for cognitive agents. In order to set the grounds for the proofs, we first introduce a rigorous way in which to define the informational, motivational, and deliberative modalities of BDI logics for AgentSpeak(L) agents, according to its structural operational semantics that we introduced in a recent paper. This computationally grounded semantics for the BDI modalities forms the basis of a framework that can be used to further investigate BDI properties of AgentSpeak(L) agents, and contributes towards establishing firm theoretical grounds for a BDI approach to agent-oriented programming.
Rapid prototyping and requirements specification using PDS
Authors: A. Klausner, T. E. Konchan
Venue: Proceedings of the workshop on Rapid prototyping (1982)

Rapid Prototyping is a software development methodology which can reduce development cost by aiding the requirements definition, design, and coding of a software system. PDS is an integrated programming environment which can support rapid prototyping. and it was used by the authors to build a prototype of a relational database system. Observations on both rapid prototyping and PDS are given, and a requirements specification language is proposed as a natural extension to PDS.
Multicast connection capacity of WDM switching networks with limited wavelength conversion
Authors: Xiangdong Qin, Yuanyuan Yang
Venue: IEEE/ACM Transactions on Networking (TON) (2004)

Currently, many bandwidth-intensive applications require multicast services for efficiency purposes. In particular, as wavelength division multiplexing (WDM) technique emerges as a promising solution to meet the rapidly growing demands on bandwidth in present communication networks, supporting multicast at the WDM layer becomes an important yet challenging issue. In this paper, we introduce a systematic approach to analyzing the multicast connection capacity of WDM switching networks with limited wavelength conversion. We focus on the practical all-optical limited wavelength conversion with a small conversion degree d (e.g., d = 2 or 3), where an incoming wavelength can be switched to one of the d outgoing wavelengths. We then compare the multicast performance of the network with limited wavelength conversion to that of no wavelength conversion and full wavelength conversion. Our results demonstrate that limited wavelength conversion with small conversion degrees provides a considerable fraction of the performance improvement obtained by full wavelength conversion over no wavelength conversion. We also present an economical multistage switching architecture for limited wavelength conversion. Our results indicate that the multistage switching architecture along with limited wavelength conversion of small degrees is a cost-effective design for WDM multicast switching networks.
A study of topic similarity measures
Authors: Ryen W. White, Joemon M. Jose
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In this poster we describe an investigation of topic similarity measures. We elicit assessments on the similarity of 10 pairs of topic from 76 subjects and use these as a benchmark to assess how well each measure performs. The measures have the potential to form the basis of a predictive technique, for adaptive search systems. The results of our evaluation show that measures based on the level of correlation between topics concords most with general subject perceptions of search topic similarity.
Predicting the performance of parallel programs
Authors: V. Blanco, J. A. González, C. León, C. Rodríguez, G. Rodríguez, M. Printista
Venue: Parallel Computing (2004)

This work presents a new approach to the relation between theoretical complexity models and performance analysis and tuning. The analysis of an algorithm produces a complexity function that gives an approach to the asymptotic number of operations performed by the algorithm. The time spent on these operations depends on the software-hardware platform being used. Usually such platforms are described, from the performance point of view, through a number of parameters. Those parameters are evaluated by a benchmarking program. Though for a given available platform, the algorithmic constants associated with the complexity formula can be computed using multidimensional linear regression, there is still the problem of predicting the performance when the platform is not available. We introduce the concept of Universal Instruction Class and derive from it a set of equations relating the values of the algorithmic constants with the platform parameters. Due to the hierarchical design of current memory systems, the performance behavior of most algorithms varies in a small number of large regions corresponding to small size, medium size and large size inputs. The constants involved in the complexity formula usually have different values for these regions. Assuming we have a complexity formula for the memory resources, it is possible to find a partition of the input size space and the different values of the algorithmic constants. This way, though the complexity formula is the same, the family of constants provides the adaptability of the formula to the different stationary uses of the memory.
MICO: An Open Source CORBA Implementation
Authors: Arno Puder
Venue: IEEE Software (2004)

MICO is one of many implementations of CORBA. Picking the right implementation for a software project depends on what programming language, operating system, and compiler the project will use and on the project's licensing requirements.
Numerical factorization of multivariate complex polynomials
Authors: Andrew J. Sommese, Jan Verschelde, Charles W. Wampler
Venue: Theoretical Computer Science (2004)

One can consider the problem of factoring multivariate complex polynomials as a special case of the decomposition of a pure dimensional solution set of a polynomial system into irreducible components. The importance and nature of this problem however justify a special treatment. We exploit the reduction to the univariate root finding problem as a way to sample the polynomial more efficiently, certify the decomposition with linear traces, and apply interpolation techniques to construct the irreducible factors. With a random combination of differentials we lower multiplicities and reduce to the regular case. Estimates on the location of the zeroes of the derivative of polynomials provide bounds on the required precision. We apply our software to study the singularities of Stewart-Gough platforms.
Indexing the Trajectories of Moving Objects in Networks (Extended Abstract)
Authors: Victor Teixeira de Almeida, Ralf Hartmut Guting
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

The management of moving objects has been intensively studied in recent years.A wide and increasingrange of database applications has to deal with spatial objects whose position changes continuously over time. The main interest of these applications is to efficiently storeand query the positions of these objects. To achieve thisgoal, index structures are required. Most of the proposals of index structures for moving objects deal with unconstrained 2-dimensional movement. The constrainedmovement is a special and a very important case of objectmovement. In this paper we propose a new index structure for moving objects in networks,the MON-Tree. We tested our proposal in an experimental evaluation withgenerated data sets. The MON-Tree showed good scalability when increasing the number of objects and time units in the index structure, and the query window and time interval in querying.
Theory and application of cellular automata for pattern classification
Authors: Pradipta Maji, Chandrama Shaw, Niloy Ganguly, Biplab K. Sikdar, P. Pal Chaudhuri
Venue: Fundamenta Informaticae (2003)

This paper presents the theory and application of a high speed, low cost pattern classifier. The proposed classifier is built around a special class of sparse network referred to as Cellular Automata (CA). A specific class of CA, termed as Multiple Attractor Cellular Automata (MACA), has been evolved through Genetic Algorithm (GA) formulation to perform the task of pattern classification. The versatility of the classification scheme is illustrated through its application in three diverse fields - data mining, image compression, and fault diagnosis. Extensive experimental results demonstrate better performance of the proposed scheme over popular classification algorithms in respect of memory overhead and retrieval time with comparable classification accuracy. Hardware architecture of the proposed classifier has been also reported.
Survey on classes of interpretations and some of their applications
Authors: Irène Guessarian
Venue: ACM SIGACT News (1983)

We introduce classes of interpretations. We characterize the free and Herbrand interpretations for a class. We define the algebraic, equational, relational and first-order classes of interpretations, study their properties and relate them to the literature. We apply this study to derive complete proof systems for deducing (in some (in) equational logic) all (in) equalitions valid in a class.
The Join Problem in Dynamic Network Algorithms
Authors: Kishori M. Konwar, Dariusz R. Kowalski, Alexander A. Shvartsman
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Distributed algorithms in dynamic networks often employcommunication patterns whose purpose is to disseminateinformation among the participants. Gossiping is oneform of such communication pattern. In dynamic settingsthe set of participants can change substantially as new participantsjoin, and as failures and voluntary departures removethose who have joined previously. A natural questionfor such settings is: how soon can newly joined nodes discovereach other by means of gossiping? This paper abstractsand studies the Join Problem for dynamic systemsthat use all-to-all gossip. The problem is studied in terms ofjoin-connectivity graphs where vertices represent the participantsand where each edge represents one participant'sknowledge about another. Ideally, such a graph has diameterone, i.e., all participants know each other. The diametercan grow as new participants join, and as failures removeedges from the graph. Gossip helps participants discoverone another, decreasing the diameter. The results describethe lower and upper bounds on the number of communicationrounds such that the participants who have previouslyjoined discover one another, under a variety of assumptionsabout the joining and failures. For example, inthe case when new participants join at multiple participantsand participants may crash, the number of rounds cannot bebounded. In the more benign cases when the failures can becontrolled or when new participants join at only one participant,the bound on rounds is shown to be logarithmic inthe diameter of the initial configuration.
Empirical Quantification of Pessimism in State-of-the-Art Scheduling Theory Techniques for Periodic and Sporadic DRE Tasks
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Distributed, Real-time, Embedded (DRE) systemspresent numerous challenges with respect to certification of theirreal-time behavior. Ideally, to address these we would like to builda model of our system that captures relevant information aboutend to end real-time requirements, resource consumptionsrequirements and resource availability, and subject the model toreal-time scheduling analysis to predict performance. Presently,scheduling theory techniques have seen limited application inDRE systems for multiple reasons including pessimisticpredictions of worst-case response times. Our study quantifies thepessimism in the predictions of worst-case response times ofcompeting end-to-end distributed periodic tasks by comparingvalues observed in simulation with values computed usingmultiple scheduling theory techniques. Specifically we considernon-greedy synchronization protocols for tasks with a high degreeof recurrence. Our results show that for an end-to-end task modelnon-greedy techniques, when used with proportional deadlinemonotonic scheduling, reduce the pessimism in worst-caseresponse time predictions to within 5% of the actual value in over90% of cases. These (quasi) static techniques represent a baselineagainst which we can evaluate emerging, control theoretic,adaptive scheduling methods.
Selective electroless copper plating micro-coil assisted by 248 nm excimer laser
Authors: C. T. Pan
Venue: Microelectronic Engineering (2004)

In the study, template of micro-coil patterns created by the excimer laser and activated by reactants for electroless copper plating is described. The generated micro-coil patterns are transformed into copper patterns on the substrate and formed copper microstructures. This method simplifies the manufacturing process of making circuits on boards comparing with the conventional lithography process of forming copper patterns on the substrate. Micro-patterns generated by the excimer laser result in the change of surface electric properties and activation selectively. A chemical reaction through the selective activated area may deposit metal, such as copper. The krypton-fluoride excimer laser (KrF, 248 nm in wavelength) not only provides simple and fast machining patterns, but also uses its high energy density to drill holes and circuits directly. Palladium ions are added as mediators in the electroless plating solution to enable a continuous electroless copper deposition. According to the experiment of excimer laser assisted electroless copper plating, the procedures of pretreatment and post cleaning are key factors resulted in excellent selective plating. The samples were pretreated by sodium dodecyl sulfate (SDS) and post cleaned by acetone and diluted nitric acid resulting in distinct micro-patterns. The deposition area is confined in the excimer laser ablated portion resulting in well selective plating.
An implicit system for predicting interests
Authors: Ryen W. White, Joemon M. Jose
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

We demonstrate an adaptive search system that works proactively to help searchers find relevant information. The system observes searcher interaction, uses what it sees to model information needs and chooses additional query terms. The system watches for changes in the topic of the search and selects retrieval strategies that reflect the extent to which the topic is seen to change.
Lazy query evaluation for Active XML
Authors: Serge Abiteboul, Omar Benjelloun, Bogdan Cautis, Ioana Manolescu, Tova Milo, Nicoleta Preda
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

In this paper, we study query evaluation on Active XML documents (AXML for short), a new generation of XML documents that has recently gained popularity. AXML documents are XML documents whose content is given partly extensionally, by explicit data elements, and partly intensionally, by embedded calls to Web services, which can be invoked to generate data.A major challenge in the efficient evaluation of queries over such documents is to detect which calls may bring data that is relevant for the query execution, and to avoid the materialization of irrelevant information. The problem is intricate, as service calls may be embedded anywhere in the document, and service invocations possibly return data containing calls to new services. Hence, the detection of relevant calls becomes a continuous process. Also, a good analysis must take the service signatures into consideration.We formalize the problem, and provide algorithms to solve it. We also present an implementation that is compliant with XML and Web services standards, and is used as part of the ActiveXML system. Finally, we experimentally measure the performance gains obtained by a careful filtering of the service calls to be triggered.
The impacts of acceleration/deceleration on travel time models for carousel systems
Authors: Hark Hwang, Young-keun Song, Kap-hwan Kim
Venue: Computers and Industrial Engineering (2004)

Carousel systems become increasingly popular in industries on account of their efficiency and relatively low cost. All the research papers dealing with travel time models of carousel system assumed average uniform velocity for the carousel body movement, disregarding the acceleration/deceleration rate. Consequently, the optimal design and operating policies proposed in the literature are far from optimum, from the practical point of view. With a continuous approximation to the discrete rack face, we develop travel time models by considering the speed profiles of the carousel body movement. Under the randomized assignment policy, the expected travel times are found for a single and dual command cycle. The accuracy of the proposed models is verified by comparison with the results obtained directly from discrete racks.
Proximate point searching
Authors: Erik D. Demaine, John Iacono, Stefan Langerman
Venue: Computational Geometry: Theory and Applications (2004)

In the 2D point searching problem, the goal is to preprocess n points P = {P1,..., pn} in the plane so that, for an online sequence of query points q1, ...,qm, it can quickly be determined which (if any) of the elements of P are equal to each query point qi. This problem can be solved in O(logn) time by mapping the problem to one dimension. We present a data structure that is optimized for answering queries quickly when they are geometrically close to the previous successful query. Specifically, our data structure executes queries in time O(log d(qi-1, qi)), where d is some distance function between two points, and uses O(n logn) space. Our structure works with a variety of distance functions. In contrast, it is proved that, for some of the most intuitive distance functions d, it is impossible to obtain an O (log d(qi-1, qi)) runtime, or any bound that is o(log n).
Acquiring and incorporating state-dependent timing requirements
Authors: S. Shih, S. Liu
Venue: Requirements Engineering (2004)

Some real-time systems are designed to deliver services to objects that are controlled by external sources. Their services must be delivered on a timely basis, and the system fails when some services are delivered too late. In general, the timing requirements of the system may change when the states of the objects monitored by the system change. Such a system may fail if the timing requirements which it is designed to meet are erroneous. It may underutilize resources and consequently be costly or unreliable if the requirements are too stringent. Hence, one must identify how changes in object states call for changes in system requirements and how these changes should be incorporated into the design and implementation of the system. This paper first describes a methodology to determine timing requirements and to take into account requirement changes at runtime. The method is based on several timing requirement determination schemes. Simulation data show that these schemes are effective for applications such as mobile IP hand-offs. The paper then discusses how to incorporate this methodology in the system architecture and in the development process.
Towards more realistic (e.g., non-associative) &#x201c;and&#x201d;- and &#x201c;or&#x201d;-operations in fuzzy logic
Authors: V. Kreinovich
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2004)

How is fuzzy logic usually formalized? There are many seemingly reasonable requirements that a logic should satisfy: e.g., since AB and BA are the same, the corresponding and-operation should be commutative. Similarly, since AA means the same as A, we should expect that the and-operation should also satisfy this property, etc. It turns out to be impossible to satisfy all these seemingly natural requirements, so usually, some requirements are picked as absolutely true (like commutativity or associativity), and others are ignored if they contradict to the picked ones. This idea leads to a neat mathematical theory, but the analysis of real-life expert reasoning shows that all the requirements are only approximately satisfied. we should require all of these requirements to be satisfied to some extent. In this paper, we show the preliminary results of analyzing such operations. In particular, we show that non-associative operations explain the empirical 7&#x00b1;2 law in psychology according to which a person can normally distinguish between no more than 7 plus minus 2 classes.
A Simple Static Model for Understanding the Dynamic Behavior of Programs
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

To maintain software and to adapt it to changing requirements,one needs to have a solid understanding of both itsstructure and behavior. While there are a number of reverseengineering tools that aid in understanding the runtime behaviorof programs, these are mostly based on variants ofUML sequence diagrams or statechart diagrams. We proposea new model for understanding runtime behavior thatpresents several advantages over the more traditional models:it has a simple syntax (a very small subset of UML).Second one can tailor the same type of model to differentabstraction levels while maintaining traceability. Third,they have a clearly defined semantics that makes them executable.Finally they capture both static and dynamic aspectsof a system.We present three scenarios where our model - namedEOP-model- aids with program comprehension: (1) high-leveldebugging, with which one can observe the executionof the program at a higher level of abstraction; (2)high-level program slicing, which allows to identify the dataitems in our model that may influence an operation, regardlessof the abstraction level, and (3) generating abstractviews at varying levels of detail while maintaining traceabilitybetween model elements and the code.
Respire
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

A 3D animation for a French rock band, completed in 1 month with 5 people. Copyright held by creator.
Efficient Disk-Based K-Means Clustering for Relational Databases
Authors: Carlos Ordonez, Edward Omiecinski
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

K-means is one of the most popular clustering algorithms. This article introduces an efficient disk-based implementation of K-means. The proposed algorithm is designed to work inside a relational database management system. It can cluster large data sets having very high dimensionality. In general, it only requires three scans over the data set. It is optimized to perform heavy disk I/O and its memory requirements are low. Its parameters are easy to set. An extensive experimental section evaluates quality of results and performance. The proposed algorithm is compared against the Standard K-means algorithm as well as the Scalable K-means algorithm.