ppxscal/embedding_network huggingface dataset:
On the Efficient Methods to Solve ODEs and BVPs Using Automatic Differentiation
Authors: Arun Verma
Venue:  (1996)

A large number of physical phenomena are modeled by a system of ODEs or a system of implicit ODEs. We demonstrate applicability of automatic differentiation (AD) for solving Boundary value problems in ODEs and implicit ODEs. Initial state and parameter estimation problems. The impact of using AD is two fold. Firstly, efficient methods for computing the gradient vectors and Jacobian matrices have been developed using AD. Secondly the process of getting derivatives via AD is robust, more user friendly, and provides error free derivatives. Furthermore, techniques using AD have been developed which explot structure in the user''s computation, and particularly the structure we observe in boundary value problems or state/parameter estimation problems. We demonstrate by a few experiments the efficiency gained by the usage of AD in solving these problems.
Tactical conflict detection and resolution in a 3-d airspace
Authors: Dowek Gilles, Munoz Cesar, Geser Alfons
Venue:  (2001)

This paper presents an algorithm for detection and resolution of air traffic conflicts in a 3-dimensional (3-D) airspace for two aircraft, namely ownship and intruder. A conflict is a projected incursion of the intruder aircraft within the protected zone of the ownship. A solution is a single maneuver, to be performed by the ownship, that effectively keeps the required minimum separation without cooperation of the intruder aircraft. The input to the algorithm is the state information, i.e., horizontal position, altitude, ground track, and vertical and ground speed, of both aircraft. The algorithm outputs a set of solutions. Each solution modifies only one state parameter of the ownship: ground track, ground speed, or vertical speed. The proposed algorithm is suitable for formal verification.
On functional relation between class-selective rejection error and average number of classes
Authors: T. M. Ha
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

The paper first reviews the recently proposed optimum class-selective rejection rule. This rule provides an optimum trade-off between the error rate and the average number of (selected) classes. Then, a new general relation between the error rate and the average number of classes is presented. The error rate can directly be computed from the class-selective reject function, which in turn can be estimated from unlabelled patterns, by simply counting the rejected classes. Theoretical as well as practical implications are discussed and some future research directions are proposed.
Formal Methods of Analysis of System Properties
Authors: S. L. Kryvyi, L. Ye. Matveyeva
Venue: Cybernetics and Systems Analysis (2003)

A review of using formal methods of specification and verification of software and hardware systems is given and an approach and formal methods are proposed that make it possible to solve the so-called feature interaction problem arising in telecommunication systems.
Numerical schemes for hyperbolic systems of conservation laws with stiff diffusive relaxation
Authors: Giovanni Naldi, Lorenzo Pareschi
Venue:  (1997)

Hyperbolic systems of conservation laws often have diffusive relaxation terms that lead to a small-relaxation limit governed by reduced systems of parabolic or hyperbolic type. In such systems the understanding of basic wave pattern is difficult to achieve and standard high resolution methods fail to describe the right asymptotic behavior unless the small relaxation rate is numerically resolved. We develop high resolution underresolved numerical schemes that possess the discrete analogue of the continuous asyptotic limit, which thus are able able to approximate the equilibrium system with high order accuracy even if the limiting equations may change type. EMAIL:: ian@microian.ian.pv.cnr.it KEYWORDS:: Hyperbolic systems with stiff relaxation, Diffusive limit, Relaxation schemes, Splitting methods, Zero dissipation limit
Formal Analysis of E-Commerce Protocols
Authors: M. Papa, O. Bremer, J. Hale, S. Shenoi
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

This paper presents a formalism for the analysis of e-commerce protocols. The approach integrates logics and process calculi, providing an expressive message passing semantics and sophisticated constructs for modeling principals. A common set of inference rules for communication, reduction and information analysis supports proofs about message passing, the knowledge and behavior of principals, and protocol properties. The power of the formalism is illustrated with an analysis of the NetBill Protocol.
Bhaskar Rao designs with block size four
Authors: G. Ge, C. W. H. Lam
Venue: Discrete Mathematics (2003)

A Bhaskar Rao design, i.e., a BRD(v, k, λ), is formed by signing the v by b incidence matrix of a BIBD(v, k, λ) so that the inner product of any two distinct rows is 0. It is proved in the literature that such designs exist for k=4 with 28 possible exceptions. In this paper, we show that a BRD is equivalent to a special kind of group divisible design (GDD). By using the knowledge of GDDs, we resolve the open cases of BRD(v, 4, λ) and complete the spectrum problem on their existence.
The optimal control problem of phase relaxation models
Authors: Viorel Barbu, Marco L Bernardi, Pierluigi Colli, Gianni Gilardi
Venue:  (2000)

This work is concerned with optimal control problems with convex cost criterion governed by the relaxed Stefan problem with or without memory. The existence of an optimal control is proved and necessary conditions for a given function to be an optimal control are found. Moreover, the asymptotic analysis is performed as the time relaxation parameter tends to~zero. TEL:: + 39 0382 50 5617 EMAIL:: pier@dimat.unipv.it
Accurate Clinical Decision Support for Heart Disease Using Models of Different Stratification Bias
Authors: K. E. Burn-Thornton, S. I. Thorpe
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

In this paper we discuss the results of investigations into the effect of stratification bias, of ECG data, on classification accuracy of patient state. These results should enable physicians to determine the minimum size, and stratification bias, of data set required to achieve a specific classification accuracy for determination of the presence of heart disease.
Information technology practitioner skills in Europe: current status and challenges for the future
Authors: Wolffried Stucky, Matthew Dixon, Peter Bumann, Andreas Oberweis
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

The current state of the IT practitioner labour market in Europe is considered, together with the role and contribution of the Council of European Professional Informatics Societies (CEPIS). An important recent CEPIS study is reported, and a new approach to tracking the progress of people towards full IT professional status is introduced. The growing contribution of the new European Certification for Informatics Professionals is flagged, and the paper concludes with some suggestions for policy priorities at the European level.
Word Endpoint Correction Techniques for a Text-to-Multimedia Composition System
Authors: Keith Turkowski, Babak Hamidzadeh
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

In concatenative Text-to-Multimedia composition systems, accurate endpoint detection of the uttered audio words, used as input into such systems, is needed to ensure optimal audio concatenation. In this paper, we outline a method of endpoint detection that takes advantage of the fact that the text of the audio word is known before endpoint detection actually takes place. From the text, the associated phonemes for an uttered audio word can be determined and used to fine tune the endpoint detection for a specific given phoneme.
ADDROL: A Method for On-Line Reorganization in a Multisystem DBMS with Shared Disks
Authors: Vlad I. Wietrzyk, Mehmed A. Orgun
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

This paper describes the design of a method, called ADDROL - Algorithm for Distributed Database Reorganization On-Line, which supports on-line reorganization of the distributed database. The contributions of this paper are both of theoretical and of experimental nature. We present an algorithm for maintaining the bi-connected components of a graph during a sequence of edge insertions and deletions. We have also considered making online reorganization restartable. Our method incrementally saves work already done while maintains consistency after system crashes.
Global Rate Control Scheme for MPEG-2 HDTV Parallel Encoding System
Authors: K. Nakamura, M. Ikeda, T. Yoshitome, T. Ogura
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This paper proposes a new rate control scheme for an MPEG-2 HDTV parallel encoding system consisting of multiple encoding units. In this rate control scheme, the target number of bits is allocated to each encoding unit every frame period using the complexity of the divided parts of an image. We evaluate this rate control scheme and verify that its image quality is as good as or better than that of single encoding.
UML-SPACES: A UML Profile for Distributed Systems Coordinated Via Tuple Spaces
Authors: Egidio Astesiano, Gianna Reggio
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Coordination via tuple spaces is a well known and accepted technique for designing distributed systems; originally introduced in Linda, it has been very recently adopted within the Java environment as underlying mechanism of the JavaSpaces TM technology. Here we explore the possibility of using such technique in the development of systems adopting the UML notation. While tuple spaces are modelled quite naturally in UML as particular classes, state machines do not seem adequate for modelling active objects interacting via tuple spaces. Thus, we propose to extend state machines by adding transition triggers corresponding to successful and failed execution of lookup operations on a tuple space. The result is a UML profile, and thus a visual notation, for modelling distributed systems based on tuple spaces.
Pixel Bar Charts: A New Technique for Visualizing Large Multi-Attribute Data Sets without Aggregation
Authors: Daniel Keim, Ming Hao, Umesh Dayal, Meichun Hsu, Julain Ladisch
Venue: Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01) (2001)

Simple presentation graphics are intuitive and easy-to-use, but show only highly aggregated data and present only a very limited number of data values (as in the case of bar charts). In addition, these graphics may have a high degree of overlap which may occlude a significant portion of the data values (as in the case of the x-y plots). In this paper, we therefore propose a generalization of traditional bar charts and x-y-plots which allows the visualization of large amounts of data. The basic idea is to use the pixels within the bars to present the detailed information of the data records. Our so-called pixel bar charts retain the intuitiveness of traditional bar charts while allowing very large data sets to be visualized in an effective way. We show that, for an effective pixel placement, we have to solve complex optimization problems, and present an algorithm which efficiently solves the problem. Our application using real-world e-commerce data shows the wide applicability and usefulness of our new idea.
Order in Space: A General Formalism for Spatial Reasoning
Authors: Baher A. El-Geresy, Alia I. Abdelmoty
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

In this paper we propose a general approach for reasoning in space. The approach is composed of a set of two general constraints to govern the spatial relationships between objects in space, and two rules to propagate relationships between those objects. The approach is based on a uniform representation of the topology of the space as a connected set of components using a structure called adjacency matrix which can capture the topology of objects of different complexity in any space dimension. The relationships between objects are represented by the intersection of the space components. The approach is also shown to be applicable to reasoning in the temporal domain and is used to explain the conceptual neighborhood phenomenon related to the reasoning process. A major advantage of the method is that reasoning between objects of any complexity can be achieved in a defined limited number of steps. Hence, the incorporation of spatial reasoning mechanisms in spatial information systems becomes possible.
Search Space Reduction in QoS Routing
Authors: Liang Guo, Ibrahim Matta
Venue:  (1999)

Abstract To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of-Service (QoS) constraints. However, the problem of constrained shortest (least-cost) path routing is known to be NP-hard, and some heuristics have been proposed to find a near-optimal solution. However, these heuristics either impose relationships among the link metrics to reduce the complexity of the problem which may limit the general applicability of the heuristic, or are too costly in terms of execution time to be applicable to large networks. In this paper, we focus on solving the delay-constrained minimum-cost path problem, and present a fast algorithm to find a near-optimal solution. This algorithm, called DCCR (for Delay-Cost-Constrained Routing), is a variant of the k-shortest path algorithm. DCCR uses a new adaptive path weight function together with an additional constraint imposed on the path cost, to restrict the search space. Thus, DCCR can return a near-optimal solution in a very short time. Furthermore, we use the method proposed by Blokh and Gutin to further reduce the search space by using a tighter bound on path cost. This makes our algorithm more accurate and even faster. We call this improved algorithm SSR+DCCR (for Search Space Reduction+DCCR). Through extensive simulations, we confirm that SSR+DCCR performs very well compared to the optimal but very expensive solution. (This technical report revises TR NU-CCS-98-09.)
Building Reusable Software Architectures with Ada 95
Authors: Alejandro Alonso, Juan Antonio de la Puente, Angel Alvarez Technical
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

A new method for building reusable generic software architectures from reusable software components is described in the paper. The method is based on the use of generic module parameters, and can be directly supported by language features only in Ada95. In this way, we can have the compiler enforcing a system architecture and enable it to check for proper use of its components. An example is given which illustrates the application of the method to a simple real-time architecture.
An Autonomous Decentralized Scheduling Algorithm for a Job Shop Process with a Multi-Function Machine in Parallel
Authors: Hitoshi Iima, Ryoichi Kudo, Nobuo Sannomiya, Yasunori Kobayashi
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

This paper deals with a job shop scheduling problem with a multi-function machine. In this problem, the multi-function machine can process all operations, and each operation is processed by either a single-function machine or the multi-function machine. This problem has two objective functions. One is to minimize the sum of the tardiness of each job, and the other is to maximize the working time of the multi-function ma-chine because of the operating cost of machines. An autonomous decentralized scheduling algorithm is pro-posed to obtain a compromise solution of this problem. In this algorithm, a number of decision makers are called subsystems which cooperate with one another in order to attain the goal of the overall system. In our algorithm, all jobs and the multi-function machine are defined as the subsystems because their objective func-tions are competitive. They determine the scheduling plan on the basis of their cooperation and their own objective functions. The effectiveness of the algorithm is investigated by examining numerical results.
Finding Essential Attributes from Binary Data
Authors: Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
Venue: Annals of Mathematics and Artificial Intelligence (2003)

We consider data sets that consist of n-dimensional binary vectors representing positive and negative examples for some (possibly unknown) phenomenon. A subset S of the attributes (or variables) of such a data set is called a support set if the positive and negative examples can be distinguished by using only the attributes in S. In this paper we study the problem of finding small support sets, a frequently arising task in various fields, including knowledge discovery, data mining, learning theory, logical analysis of data, etc. We study the distribution of support sets in randomly generated data, and discuss why finding small support sets is important. We propose several measures of separation (real valued set functions over the subsets of attributes), formulate optimization models for finding the smallest subsets maximizing these measures, and devise efficient heuristic algorithms to solve these (typically NP-hard) optimization problems. We prove that several of the proposed heuristics have a guaranteed constant approximation ratio, and we report on computational experience comparing these heuristics with some others from the literature both on randomly generated and on real world data sets.
Encoding Neural Networks to Compute the Atmospheric Point Spread Function
Authors: Bin Cong
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Images of the Earth's surface acquired by high-altitude aircraft or satellites are degraded by the intervening atmosphere. The imaging instrument records not only the signal of the targeted viewing area but also the radiance scattered into the field of view in the near by area. This effect can be characterized by an atmospheric point spread function (PSF). Many parameters may affect the PSF. To restore noisy-blurred images, one must understand which parameters influence the PSF and to what degree. This is very important for scientific applications that seek to extract information about environmental systems.In this paper, a design and implementation of a distributed representation scheme and neural networks are presented in order to estimate the atmospheric PSF. The representation scheme exemplifies the conjunctive coding and coarse coding techniques. Neural networks trained using such an appropriately structured representation generate a desired approximation of the PSF with satisfactory processing time. 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
On-the-fly Sending: A Low Latency High Bandwidth Message Transfer Mechanism
Authors: N. Tanabe, J. Yamamoto, H. Nishi, T. Kudoh, Y. Hamada, H. Nakajo, H. Amano
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

Low latency high bandwidth network interface architectures are described. This paper proposes two types of architectures, atomic on-the-fly (OTF) sending with a header TLB, and block on-the-fly sending with protection stampable window memory. These techniques work very effectively with MEMOnet which is a class of network interface card(NIC) plugged into a memory slot. We are developing a network interface controller LSI called Martini. The Martini chip is used in two prototype network interface cards, DIMMnet-1 based on MEMOnet, and RHiNET-2INI based on PCI. On a DIMMnet-I, the software overhead needed to generate a message is only 1 CPU cycle and the estimated hardware delay is less than 1OOns using atomic OTF sending. The estimated achievable sending bandwidth of DIMMnet-I using block OTF sending is 984MBls which was observed in our experiments. This bandwidth is 7.4times higher than the maximum bandwidth of PCI. Thisexcellent performance is available for cheap personal computers with DIMM slots. This paper also describes the effects of block OTF sending for a PCI-based NIC.
Infinitary lambda calculus
Authors: J. R Kennaway, Jan W Klop, M. R Sleep, Fer Vries
Venue:  (1995)

In a previous paper we have established the theory of transfinite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of infinitary rewriting, the Böhm model of the lambda calculus can be seen as an infinitary term model. In contrast to term rewriting, there are several different possible notions of infinite term, which give rise to different Böhm-like models, which embody different notions of lazy or eager computation.
On Coherence, Random-Self-Reducibility, and Self-Correction
Authors: Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish Naik
Venue:  (1996)

We address two questions about self-reducibility -- the power of adaptiveness in examiners that take advice and the relationship between random-self-reducibility and self-correctability. We first show that adaptive examiners are more powerful than nonadaptive examiners, even if the nonadaptive ones are nonuniform. Blum et al. [Blum, Luby and Rubinfeld, Journal of Computer and System Sciences, 59:549--595, 1993] showed that every random-self-reducible function is self-correctable. However, whether self-correctability implies random-self-reducibility is unknown. We show that, under a reasonable complexity hypothesis, there exists a self-correctable function that is not random-self-reducible. For P-sampleable distributions, however, we show that constructing a self-correctable function that is not random-self-reducible is as hard as proving that P is not equal to PP. This work was presented in preliminary form at the IEEE Conference on Computational Complexity, Philadelphia PA, May 1996.
Internetworking between OSI and TCP/IP network managements with security features
Authors: Taeyeon Kim, Bongnam Noh
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

To integrate both the OSI network and the TCP/IP internet the application gateway with powerful and flexible paradigms has been used, but micro-managements of the gateway produces high communication costs and long delays in responding to critical situations. The mechanism that maps the access control policy is needed between two domains using different security policies. These problems are caused by managing each domain with different standards. In this paper, we propose an application gateway that delegates powerful and complex services of the CMIP as well as management functions sent to an agent by a manager in order to reduce network management costs and delays. We also suggest a security mechanism converting the security policy in order to guarantee safe communication between two domains