ppxscal/embedding_network huggingface dataset:
B-splines: a powerful and flexible numerical basis for the continuum spectrum of the Schr&#x00F6;dinger equation. An application to hydrogenic atomic systems
Authors: L. A. A. Nikolopoulos
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

We present a method for the accurate calculation of the complete spectrum of the Schrödinger equation in terms of B-splines polynomial basis. The method is capable to represent numerically the bound and continuum spectrum of complex atomic systems. The theoretical method is discussed, and an application to hydrogenic hamiltonian is given.
Self-shadowing bump map using 3D texture hardware
Authors: Tom Forsyth
Venue: Journal of Graphics Tools (2002)

Self-shadowing bump maps add realism and depth to scenes and provide important visual cues. Previous techniques have shown self-shadowing at interactive rates, but at a substantial cost over standard normal mapped bump mapping. This paper uses volume textures on consumer graphics hardware, using few enough resources that they can be easily added to existing normal map bump mapping renderers. The ways the technique can be scaled according to available memory constraints are also explored.
Opportunistic routing in multi-hop wireless networks
Authors: Sanjit Biswas, Robert Morris
Venue: ACM SIGCOMM Computer Communication Review (2004)

This paper describes Extremely Opportunistic Routing (ExOR), a new unicast routing technique for multi-hop wireless networks. ExOR forwards each packet through a sequence of nodes, deferring the choice of each node in the sequence until after the previous node has transmitted the packet on its radio. ExOR then determines which node, of all the nodes that successfully received that transmission, is the node closest to the destination. That closest node transmits the packet. The result is that each hop moves the packet farther (or average) than the hops of the best possible pre-determined route.The ExOR design addresses the challenge of choosing a forwarding node after transmission using a distributed algorithm. First, when a node transmits a packet, it includes in the packet a simple schedule describing the priority order in which the potential receivers should forward the packet. The node computes the schedule based on shared measurements of inter-node delivery rates. ExOR then uses a distributed slotted MAC protocol for acknowledgements to ensure that the receivers agree who the highest priority receiver was.The efficacy of ExOR depends mainly on the rate at which the reception probability falls off with distance. Simulations based on measured radio characteristics [6] suggest that ExOR reduces the total number of transmissions by nearly a factor of two over the best possible pre-determined route.
MPSSF: A Buffering & Forwarding Handover Scheme Reducing Out-of-Sequence Packets
Authors: Jian-Li Zheng, Xue-Ping Wang, Gen-Du Zhang
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

In order to minimize packets loss during handover, fast handover technique as well as packet buffering & forwarding techniques are adopted by micro-mobility protocols in All-IP wireless mobile network. There are mainly two kinds of buffering & forwarding schemes,multi-stream and single-stream. The multi-stream scheme is simple but can lead to the creation of out-of- sequence packets. As an alternation without out-of-sequence packets, single-stream scheme consumes extra network resources. A new scheme called MPSSF (Multi-Path Single Stream Forwarding) is proposed in this article. It features less out-of-sequence as single-stream scheme, but extra consuming of network resources is reduced remarkably.
Virtual mouse vision based interface
Authors: Paul Robertson, Robert Laddaga, Max Van Kleek
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

A vision-based virtual mouse interface is described that utilizes a robotic head, visual tracking of the users head and hand positions and recognition of user hand signs to control an intelligent kiosk. The user interface supports, among other things, smooth control of the mouse pointer and buttons using hand signs and movements. The algorithms and architecture of real-time vision and robot controller are described.
Component-based software development for integrated construction management software applications
Authors: Feniosky Peña-mora, Sanjeev Vadhavkar, Siva Kumar Dirisala
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

This paper presents a framework and a prototype for designing Integrated Construction Management (ICM) software applications using reusable components. The framework supports the collaborative development of ICM software applications by a group of ICM application developers from a library of software components. The framework focuses on the use of an explicit software development process to capture and disseminate specialized knowledge that augments the description of the ICM software application components in a library. The importance of preserving and using this knowledge has become apparent with the recent trend of combining the software development process with the software application code. There are three main components in the framework: design patterns, design rationale model, and intelligent search algorithms. Design patterns have been chosen to represent, record, and reuse the recurring design structures and associated design experience in object-oriented software development. The Design Recommendation and Intent Model (DRIM) was extended in the current research effort to capture the specific implementation of reusable software components. DRIM provides a method by which design rationale from multiple ICM application designers can be partially generated, stored, and later retrieved by a computer system. To address the issues of retrieval, the paper presents a unique representation of a software component, and a search mechanism based on Reggia's setcover algorithm to retrieve a set of components that can be combined to get the required functionality is presented. This paper also details an initial, proof-of-concept prototype based on the framework. By supporting nonobtrusive capture as well as effective access of vital design rationale information regarding the ICM application development process, the framework described in this paper is expected to provide a strong information base for designing ICM software.
Design of a persistent programming environment in an object oriented language using clustering and composite objects
Authors: M. N. Sim, P. M. Dewilde
Venue: Proceedings of the conference on European design automation (1991)

We describe how the Object Oriented and Persistent paradigms are incorporated in a generic system for creating a persistent environment that interfaces between tools defined in a conventional object oriented language and a DBMS. The system is based on a software library of classes that together form a mechanism that can manage configurations of structured and unstructured data and can be employed recursively to define and manage composite objects.
IntelliBid: An Event-Trigger-Rule-Based Auction System over the Internet
Authors: Nicky Joshi, Kushal Thakore, Stanley Y. W. Su
Venue: World Wide Web (2004)

This paper presents the design and implementation of an Event-Trigger-Rule-Based auction system called IntelliBid. A network of Knowledge Web Servers, each consisting of a Web server, an Event-Trigger-Rule (ETR) Server, an Event Engine, a Knowledge Profile Manager, and Bid Servers and their proxies constitutes IntelliBid. Together, they provide auction-related services to the creator of an auction site and the bidders and suppliers of products. IntelliBid offers a number of desirable features. First and foremost is the flexibility offered to bidders for defining their own rules to control their bids in an automatic bidding process, which frees the bidders from having to be on-line to place bids. By using different rules, the bidders can apply different bidding strategies. Second, it furnishes valuable statistical information about past auctions to both suppliers (or sellers) and bidders. The information can assist a bidder in bidding and a seller in setting a reasonable base price and/or the minimum incremental price. Third, since rules that control the automatic bidding are installed and processed by the ETR servers installed at bidders' individual sites, bidders' privacy and security are safeguarded. The statistical information that is released by IntelliBid only depicts the trend of the bidding prices of a product. The information about bidders is kept completely secret, thus safeguarding the privacy of the bidders. Fourth, IntelliBid's event, event filtering and event notification mechanisms keep both bidders and suppliers timely informed of auction events so that they or their software system can take the proper actions in the auction process. Fifth, any registered user of IntelliBid, bidder or supplier, can monitor the bids placed to any product being auctioned in IntelliBid. Sixth, IntelliBid allows bidders to do both on-line (or manual) bidding and automatic bidding. It also allows a bidder to participate in several auctions at the same time, in both manual and automated modes. The bidding of a product can depend on the result of the bidding of another product. Last, but not least, IntelliBid allows a person or organization to play both the role of bidder and the role of supplier simultaneously. The Profile Manager keeps the information as a bidder and information as a supplier separately. Moreover, IntelliBid's architecture uses a parallel event management system to do event registration and notification. This paper also reports the result of a performance study on the implication of using such a parallel system to achieve scalability.
Two sensitivity theorems in fuzzy integer programming
Authors: A. S. Asratian, N. N. Kuzjurin
Venue: Discrete Applied Mathematics (2004)

We consider the problem of estimating optima of covering integer linear programs with 0-1 variables under the following conditions: we do not know exact values of elements in the constraint matrix A but we know what elements of A are zero and what are nonzero, and also know minimal and maximal values of nonzero elements. We find bounds for variation of the optima of such programs in the worst and average cases. We also find some conditions guaranteeing that the variation of the optimum of such programs in the average case is close to 1 as the number of variables tends to infinity. This means that the values of nonzero elements in A can vary without significantly affecting the value of the optimum of the integer program.
Approaches for constrained parametric curve interpolation
Authors: Cai Ming Zhang, Xing Qiang Yang, Jia Ye Wang
Venue: Journal of Computer Science and Technology (2003)

The construction of a GC1 cubic interpolating curve that lies on the same side of a given straight line as the data points is studied. The main task is to choose appropriate approaches to modify tangent vectors at the data points for the desired curve. Three types of approaches for changing the magnitudes of the tangent vectors are presented. The first-type approach modifies the tangent vectors by applying a constraint to the curve segment. The second one does the work by optimization techniques. The third one is a modification of the existing method. Three criteria are presented to compare the three types of approaches with the existing method. The experiments that test the effectiveness of the approaches are included.
A policy management framework for GMPLS optical networks
Authors: Nathalie Rico, Omar Cherkaoui, Halima Elbiaze
Venue: Network control and engineering for Qos, security and mobility II (2003)

This paper presents a policy-based management framework for GMPLS-enabled optical networks. First, the (Automatic Switched Optical Networks) and GMPLS (Generalized Multi-Protocol Label Switching) architecture are presented. We then present a framework based on an admission control protocol COPS (Common Open Policy Service) defined by the IETF (Internet Engineering Task Force) and on an Information Model based on the CIM (Common Information Model) model defined by DMTF (Distributed Management Task Force). This framework allows interworking between the policy and control plane, and provides a comprehensive policy provisioning setup for optical networks. An information model extended from CIM for managing dynamically configured optical networks is presented.
Classroom discussions: policies and responsibilities of Internet Service Providers
Authors: Mary J. Granger, Joyce Currie Little
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

Since the early to mid 1990s, with the advent of easy to use browser software, the Internet has become available to those outside the community of researchers and knowledgeable users. Currently, anyone with computing and some type of networking capability is able to connect to the internet: some still through University and work-place links, others through internet Service Providers (ISPs). For their customers, these ISP provide an entry point into the Internet and may control or monitor activities on the Internet. Additionally, since the Internet is an international network, it should not be overlooked that some governments control access or the ISPs, which presents a different set of issues than those encountered in the United States. The purpose of this paper is to raise awareness of policies and responsibilities of Internet Service Providers related to usage of the Internet. It is suggested that these issues be incorporated in classroom discussions. Some of the topics which may be explored by using ISPs policies in an educational setting are intellectual property concerns, 'cookies,' third party sites and access, collection of personal information - what, how and usage, security of information, regulation of children's access to the Internet, globalization issues and legal issues arising with the use of an ISP to access the Internet.
N-division output coding method applied to face recognition
Authors: Jaepil Ko, Hyeran Byun
Venue: Pattern Recognition Letters (2003)

Most research on face recognition has focused on representation of face appearances rather than the classifiers. For robust classification performance, we need to adopt elaborate classifiers. Output coding is suitable for this purpose because it can allow online learning. In this paper, we propose an N-division output coding method. In the experiments we demonstrate such properties as problem complexity, margin of separation, machine relevance and the recognition performance among different output coding methods.
A combined waveform relaxation: waveform relaxation newton algorithm for efficient parallel circuit simulation
Authors: P. Odent, L. Claesen, H. De Man
Venue: Proceedings of the conference on European design automation (1990)

This paper presents two new techniques for accelerating circuit simulation. The first technique is an improvement of the parallel Waveform Relaxation Newton (WRN) method. The computations of all the timepoints are executed concurrently. Static task partitioning is shown to be an efficient method to limit the scheduling overhead. The second technique combines in a dynamic way the efficiency of the parallel version of the Waveform Relaxation (WR) method and the parallelism of the new developed parallel WRN algorithm.
HOL-&lambda;&sigma;: an intentional first-order expression of higher-order logic
Authors: Gilles Dowek, Therese Hardin, Claude Kirchner
Venue: Mathematical Structures in Computer Science (2001)

We give a first-order presentation of higher-order logic based on explicit substitutions. This presentation is intentionally equivalent to the usual presentation of higher-order logic based on &lambda;-calculus, that is, a proposition can be proved without the extensionality axioms in one theory if and only if it can be in the other. We show that the Extended Narrowing and Resolution first-order proof-search method can be applied to this theory. In this way we get a step-by-step simulation of higher-order resolution. Hence, expressing higher-order logic as a first-order theory and applying a first-order proof search method is a relevant alternative to a direct implementation. In particular, the well-studied improvements of proof search for first-order logic could be reused at no cost for higher-order automated deduction. Moreover, as we stay in a first-order setting, extensions, such as equational higher-order resolution, may be easier to handle.
A derived Markov process for modeling reaction networks
Authors: John H. Holland
Venue: Evolutionary Computation (2003)

A reaction network arises when a set of reactants (chromosomes, chemicals, economic goods, or the like) recombine at specified rates to produce other reactants in the set. When the reactants are characterized in terms of "reactive regions" (schemata, active sites, building blocks), reaction networks can be modeled by classic stochastic urn models. The corresponding Markov processes are specified by matrices that, for realistic problems, are small enough to allow standard matrix operations and Monte Carlo estimates of important properties of the trajectory of the process, such as the expected time to first occurrence of some designated reactant.
Modeling and simulation of FPGA-based variable-speed drives using Simulink
Authors: Francesco Ricci, Hoang Le-Huy
Venue: Mathematics and Computers in Simulation (2003)

This paper presents a novel approach for the design and simulation of variable-speed drives when the control algorithm is to be implemented in an Field Programmable Gate Array (FPGA). The specialized Simulink tools used and the design procedure are presented. An application example using a Direct Torque Control (DTC) induction motor drive is presented and discussed.
A Methodology for System-Level Analog Design Space Exploration
Authors: F. De Bernardinis, A. Sangiovanni-Vincentelli
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper describes a novel approach to system level analog design. A new abstraction level "the platform" is introduced to separate circuit design from design space exploration. An Analog Platform encapsulates analog components concurrently modeling their behavior and their achievable performances. Performance models are obtained through statistical sampling of circuit configurations. The design configurations space is specified with Analog Constraint Graphs so that the sampling space is significantly reduced. System level exploration can be achieved through optimization on behavioral models constrained by performance models. Finally, an example is provided showing the effectiveness of the approach on a WCDMA amplifier.
Semantically-based text authoring and the concurrent documentation of experimental protocols
Authors: Caroline Brun, Marc Dymetman, Eric Fanchon, Stanislas Lhomme, Sylvain Pogodalla
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

We describe an application of controlled text authoring to biological experiment reports. This work is the result of a collaboration between a computational linguistics team and biologists specializing in protein production studies. We start by presenting our semantically-controlled authoring system, MDA (Multilingual Document Authoring), an expressive model for specifying well-formedness conditions both at the level of the document content and at the level of its textual realization. We then discuss the practical needs of experiment documentation in bioengineering. We go on to describe the prototype we have developed for this application domain, along with a preliminary evaluation. Finally we discuss a promising new idea emerging from the experimentation but which seems of wider applicability: how the authoring system represents a step towards integrating the formalization of an experimental protocol with its associated textual documentation.
Mobility support framework in adaptable service architecture
Authors: Mazen Malek Shiaa
Venue: Network control and engineering for Qos, security and mobility II (2003)

Mobility is regarded as the most important feature needed to achieve adaptability and flexibility in the execution of service components. As such, service systems could be able to cope with the handling of dynamic changes in the availability of resources and position of users. On the other hand, providing user-centric and personal-content driven wide range of services, more commonly wireless ones, to end users regardless of their location and used equipment, seem to be the most important objective of such a feature. Mobility, in this context, is a feature facilitating the free and coordinated movement of, for instance, users, software components, user terminals, etc. One should always consider the vibrant configuration and settings of not only end-users applications and environment, but also the network resources, components and services. The reason is due to the ever changing and increasing demands and requirements in functionality, security, reliability and QoS. Mobility support in self-managing, dynamically configurable network architecture seems to be even more challenging, however recent development and improvements in network infrastructure show a greater prospect for code-on-demand and adaptive network management. TAPAS, and its mobility handling architecture, presented in this paper, tend to give some answers and take a step towards achieving such goals.
ULT: a Java threads model for platform independent execution
Authors: Ruben Pinilla, Marisa Gil
Venue: ACM SIGOPS Operating Systems Review (2003)

Java is known to be a valuable technology for building platform independent applications, based on an independent execution environment provided by a virtual machine (JVM, Java Virtual Machine) and an API formed by a set of classes. The Java platform was conceived as a solution for application transportation between heterogeneous platforms without the need of adapting and recompiling the source code. Some previous analyses of Sun JVM implementation (Java 2 SDK 1.2.2-006) establish that the HPI (Host Porting Interface) layer does not abstract enough the concurrency offered by the underlying platform.Consequently, the execution of the same Java application over distinct HPI platform implementations offers different behavior, being a possible cause of incorrect program execution. We consider that it's necessary a new HPI layer that can really abstract the concurrency supplied by the platform, giving a set of operations whose semantic does not vary between diverse platform implementations. With the new HPI, the JVM will be capable to perform a uniform behavior independently of the operating system. The new JVM with ULT offers an acceptable performance on multiprocessor architectures increasing the throughput and it implements a synchronization mechanism that achieves better results than the original JVM on SMP architectures.