ppxscal/embedding_network huggingface dataset:
Evolutionary computation in civil engineering: research frontiers
Authors: T. Arciszewski, K. A. De Jong
Venue: Civil and structural engineering computing: 2001 (2001)

This paper provides an overview of the state of the art of evolutionary computation in civil engineering. First, it discusses the fundamentals of evolutionary computation in the context of a unified approach recently proposed by one of the authors. Second, it discusses the main research directions, including morphogenic design and co-evolutionary design. Next, it provides a description of the emerging evolutionary computation analysis, including an analysis in the context of complex adaptive systems and one based on the visualization of the gene pool and of the fitness function. Finally, the paper contains the conclusions and recommendations for the further research.
Synthesis of continuous-time filters and analog to digital converters by integrated constraint transformation, floorplanning and routing
Authors: Hua Tang, Hui Zhang, Alex Doboli
Venue: Proceedings of the 13th ACM Great Lakes symposium on VLSI (2003)

This paper describes a layout-aware analog synthesis methodology. The methodology includes parameter exploration and classification, parameter domain pruning and sampling, and identification of parameter dependencies. The optimization process executes a combined constraint transformation, floorplanning and global routing. The paper presents results for a high frequency continuous-time filter, and two ̿Δ ADCs. Compared to similar work, the methodology is more flexible in handling new designs, and more tolerant in accommodating layout parasitics.
Assistance for telepresence by stereovision-based augmented reality and interactivity in 3D space
Authors: Philippe Fuchs, Fawzi Nashashibi, Didier Maman
Venue: Presence: Teleoperators and Virtual Environments (2002)

In this paper, we describe some use of mixed reality as a new assistance for performing teleoperation tasks in remote scenes. We will start by a brief classification of augmented reality. This paper then describes the principle of our mixed reality system in teleoperation. It tackles the problem of scene registration using a man-machine cooperative and multisensory vision system. The system provides the operator with powerful sensorial feedback as well as appropriate tools to build (and update automatically) the geometric model of the perceived scene. We describe a new interactive approach combining image analysis and mixed reality techniques for assisted 3D geometric and semantic modeling. At the end of this paper, we describe applications in nuclear plants with results in 3D positioning.
Nondeterministic Quantum Query and Communication Complexities
Authors: Ronald de Wolf
Venue: SIAM Journal on Computing (2003)

We study nondeterministic quantum algorithms for Boolean functions f. Such algorithms have positive acceptance probability on input x iff f(x)=1. In the setting of query complexity, we show that the nondeterministic quantum complexity of a Boolean function is equal to its "nondeterministic polynomial" degree. We also prove a quantum-vs.-classical gap of 1 vs. n for nondeterministic query complexity for a total function. In the setting of communication complexity, we show that the nondeterministic quantum complexity of a two-party function is equal to the logarithm of the rank of a nondeterministic version of the communication matrix. This implies that the quantum communication complexities of the equality and disjointness functions are n+1 if we do not allow any error probability. We also exhibit a total function in which the nondeterministic quantum communication complexity is exponentially smaller than its classical counterpart.
A New Lower Bound for Tree-Width Using Maximum Cardinality Search
Authors: Brian Lucena
Venue: SIAM Journal on Discrete Mathematics (2003)

The tree-width of a graph is of great importance in applied problems in graphical models. The complexity of inference problems on Markov random fields is exponential in the tree-width of the graph. However, computing tree-width is NP-hard in general. Easily computable upper bounds exist, but there are few lower bounds. We give a novel technique to compute a lower bound for the tree-width of a graph using maximum cardinality search. This bound is efficiently computable and is guaranteed to do at least as well as finding the largest clique in the graph.
On a remarkable partition identity
Authors: Jürgen Müller
Venue: Journal of Combinatorial Theory Series A (2003)

The starting point of this note is a remarkable partition identity, concerning the parts of the partitions of a fixed natural number and the multiplicities with which these parts occur. This identity is related to the ordinary representation theory of the symmetric group. Our main result is a generalization of this identity, being related to the modular representation theory of the symmetric group.
Use of depth and colour eigenfaces for face recognition
Authors: F. Tsalakanidou, D. Tzovaras, M. G. Strintzis
Venue: Pattern Recognition Letters (2003)

In the present paper a face recognition technique is developed based on depth and colour information. The main objective of the paper is to evaluate three different approaches (colour, depth, combination of colour and depth) for face recognition and quantify the contribution of depth. The proposed face recognition technique is based on the implementation of the principal component analysis algorithm and the extraction of depth and colour eigenfaces. Experimental results show significant gains attained with the addition of depth information.
On a class of left-continuous t-norms
Authors: Roberto Cignoli, Francesc Esteva, Lluís Godo, Franco Montagna
Venue: Fuzzy Sets and Systems (2002)

In this paper we study the subclass of left-continuous t-norms *n which are definable by an arbitrary continuous t-norm * and a weak (i.e. non necessarily involutive) negation n by putting x *n y = 0 if x ≤ n(y), x *n y = x * y otherwise, thus generalizing the construction of the so-called nilpotent minimum t-norms. We provide the characterization of weak negations compatible with a given continuous t-norm and conversely which are the continuous t-norms compatible with a given weak negation function.
On the ontology of a decision support system in health informatics
Authors: Pirkko Nykänen
Venue: Decision making support systems: achievements, trends and challenges for (2002)

A decision support system can be approached from two major disciplinary perspectives, those of information systems science (ISS) and artificial intelligence (AI). We present in this chapter an extended ontology for a decision support system in health informatics. The extended ontology is founded on related research in ISS and AI and on performed case studies in health informatics. The ontology explicates relevant constructs and presents a vocabulary for a decision support system, and emphasises the need to cover environmental and contextual variables as an integral part of decision support system development and evaluation methodologies. These results help the system developers to take the system's context into account through the set of defined variables that are linked to the application domain. This implies that domain and application characteristics, as well as knowledge creation and sharing aspects, are considered at every phase of development. With these extensions the focus in decision support systems development shifts from a task ontology towards a domain ontology. This extended ontology gives better support for development because from it follows that a more thorough problem analysis will be performed.
An Inventory Model with Order Crossover
Authors: Xin X. He, Susan H. Xu, J. Keith Ord, Jack C. Hayya
Venue: Operations Research (1998)

In inventory systems with stochastic lead times, it is possible that more than a single order will be outstanding. In that case, orders may cross; that is, they may not be received in the same sequence in which they are placed. In this paper we develop a multicycle analysis for the case when lead times are independently and identically distributed. When contrasted with the conventional single cycle analysis, the multicycle approach provides a more accurate assessment of the overall inventory cost and leads to a superior inventory policy.
Astrophysical computational research in a small college setting
Authors: Jason Best, Winthrop Chamberlain, Sara Maene
Venue: Journal of Computing Sciences in Colleges (2002)

At a small, primarily baccalaureate public institution, the resources normally available to astronomers at larger campuses are not to be found. No trained graduate student population is present, and limits on funding, computing resources, and standard astronomical equipment availability create obstacles to research that are unique to smaller campuses. These problems are particularly pronounced in the absence of a major or minor program in astronomy.In this paper, we will discuss the research in computational astrophysics being conducted at Shepherd College, a public institution in West Virginia with a student population of 4600. Shepherd has no physics major, no astronomy or astrophysics major or minor, and a physics minor that has had no students complete it in the past four years, and only four students complete it in the twelve years prior to 1997. Nevertheless, astrophysical research has been undertaken at Shepherd forsss the past four years, and incorporates students and staff into research in every semester. We will discuss some of the pitfalls that have been encountered, and successes that we have achieved.
Bagging improves uncertainty representation in evidential pattern classification
Authors: Jérémie François, Yves Grandvalet, Thierry Denœux, Jean-Michel Roger
Venue: Technologies for constructing intelligent systems: Tasks (2002)

Uncertainty representation is a major issue in pattern recognition when the outputs of a classifier do not lead directly to a final decision, but are used in combination with other systems, or as input to an interactive decision process. In such contexts, it may be advantageous to resort to rich and flexible formalisms for representing and manipulating uncertain information, such as the Dempster-Shafer theory of Evidence. In this paper, it is shown that the quality and reliability of the outputs from an evidence-theoretic classifier may be improved using an adaptation from a resample-and-combine approach introduced by Breiman and known as "bagging". This approach is explained and studied experimentally using simulated data. In particular, results show that bagging improves classification accuracy and limits the influence of outliers and ambiguous training patterns.
Architecture-Centered Enterprise System Development and Integration Based on Distributed Object Technology Standard
Authors: Kent Wreder, Yi Deng
Venue: 23rd International Computer Software and Applications Conference (1999)

Healthcare information systems are complex and critical enterprise systems that link together geographically distributed hospitals, clinics, physician offices and other business units with distinct business functions and mutual dependencies. In the past, these systems were built based on proprietary solutions, acquired in piecemeal fashion and tightly coupled through ad hoc means. This resulted in stovepipe systems that have many duplicated functions and are monolithic, non-extensible and non-interoperable. How to migrate from these stovepipe systems to the next generation open healthcare information systems that are interoperable, extensible and maintainable is increasingly a pressing problem for the healthcare industry. In this paper, we present our experience in addressing the problem using an architecture-centered approach for enterprise system development and integration based on distributed object technology standard OMA/CORBA. Our case study is conducted from a user organization (as opposed to developer organization) point of view and is based on a large-scale effort undertaken at the Baptist Health Systems of South Florida, a large healthcare organization serving the South Florida region. Key lessons learnt from this case study include: (1) establishing clear architectural vision is essential to successful enterprise system development; (2) adoption of standard architecture and infrastructure is the best approach to achieve interoperable, extensible and cohesive enterprise systems; and (3) an effective development methodology and business process are key to implement the architectural vision.
Confidence regions for multinomial parameters
Authors: A. J. Lee, S. O. Nyangoma, G. A. F. Seber
Venue: Computational Statistics Data Analysis (2002)

In this paper we study several different methods for setting confidence regions for multinomial parameters. We examine 12 regions based on the likelihood ratio, the score statistic, the Pearson χ2 statistic and various quadratic approximations to these. The different methods are compared in terms of coverage and volume in the context of several examples.
Genetic algorithm based product mix and material match
Authors: Sk Ahad Ali, Robert de Souza, Zahid Hossain
Venue: Second international workshop on Intelligent systems design and application (2002)

Genetic Algorithms (GA) are innovative search algorithms based on natural phenomena whose main advantages lie in solving mostly high complex problems. This paper provides how a conventional GA can effectively solve the Product Mix and Material Match problem. Some novel ideas in chromosome representation and evaluation are also addressed. This GA approach produces good results with fast convergence speed at the shop floor level, which is verified and validated via real world applications.
A web based system to capture outlines of Arabic fonts
Authors: M. Sarfraz, F. A. Razzak
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

This paper presents a Web based system for the automatic capture of Arabic fonts. The system is based on an algorithm, which incorporates various features including the detection of boundary, discovering corner and break points, and fitting the curve. The work done, in this paper, fully automate the process and produces best optimal results. Moreover the automated system developed is deployed over the Web using client/server model and state of the art technology.
Distogram: a translation - and rotation-invariant and scale-covariant signature of a primitive shape
Authors: Geehyuk Lee, Misook Sohn
Venue: Second international workshop on Intelligent systems design and application (2002)

We propose a new one-dimensional signature of a two-dimensional binary pattern, which we call distogram meaning the histogram of distances between pairs of foreground pixels. A simple test consisting of six roman capital letters is carried out in order to evaluate the discrimination ability of the proposed signature. Also, a pulse-coupled neural network is described as an example of a simple network design that can compute a distogram given a two dimensional binary pattern as an input.
Relating functional requirements and software architecture: separation and consistency of concerns
Authors: R. Heckel, G. Engels
Venue: Journal of Software Maintenance: Research and Practice (2002)

In the early stages of most software processes, functional and non-functional (such as architectural, performance, or security) requirements are expressed separately in different sub-models. Later these requirements have to be integrated into one overall system design. The integration raises consistency issues between different sub-models, which have to be resolved in the process.If requirements evolve over time, this leads to changes to the sub-models concerned. Thus, new consistency issues arise between changed and unchanged sub-models. In this case, a clear separation of concerns between different sub-models is required to keep the effect of changes as local as possible.In this paper, we use a relational approach to couple functional and architectural models while keeping them separated in order to simplify change. The approach uses meta modeling to support the static integration and concepts from the theory of graph transformation to formalize the semantic consistency of the dynamic aspects.
Scalable feature selection, classification and signature generation for organizing large text databases into hierarchical topic taxonomies
Authors: Soumen Chakrabarti, Byron Dom, Rakesh Agrawal, Prabhakar Raghavan
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (1998)

We explore how to organize large text databases hierarchically by topic to aid better searching, browsing and filtering. Many corpora, such as internet directories, digital libraries, and patent databases are manually organized into topic hierarchies, also called taxonomies. Similar to indices for relational data, taxonomies make search and access more efficient. However, the exponential growth in the volume of on-line textual information makes it nearly impossible to maintain such taxonomic organization for large, fast-changing corpora by hand. We describe an automatic system that starts with a small sample of the corpus in which topics have been assigned by hand, and then updates the database with new documents as the corpus grows, assigning topics to these new documents with high speed and accuracy. To do this, we use techniques from statistical pattern recognition to efficiently separate the feature words, or discriminants, from thenoise words at each node of the taxonomy. Using these, we build a multilevel classifier. At each node, this classifier can ignore the large number of &ldquo;noise&rdquo; words in a document. Thus, the classifier has a small model size and is very fast. Owing to the use of context-sensitive features, the classifier is very accurate. As a by-product, we can compute for each document a set of terms that occur significantly more often in it than in the classes to which it belongs. We describe the design and implementation of our system, stressing how to exploit standard, efficient relational operations like sorts and joins. We report on experiences with the Reuters newswire benchmark, the US patent database, and web document samples from Yahoo!. We discuss applications where our system can improve searching and filtering capabilities.
Airline Network Design
Authors: Phillip J. Lederer, Ramakrishnan S. Nambimadom
Venue: Operations Research (1998)

The goal of this paper is to understand choices of networks and schedules by a profit maximizing airline. By "network" we mean the routing pattern for planes and by "schedule" we mean the frequency of service between cities and the amount of time put into the schedule to assure on-time arrival. This paper analyzes network and schedule choice using an "idealized" model that permits derivation of analytic, closed form expressions for airline and passenger costs. Many important conclusions are obtained. It is optimal for a profit maximizing airline to design its network and schedule to minimize the sum of airline and passenger costs. Profit maximizing choice of schedule frequency depends on the network. Direct service has lower schedule frequency than other networks. Parametric studies are performed on the effect of distance between cities, demand rate, and the number of cities served on the choice of the network. Some conclusions are: (1) If the distance between cities is very small, then direct service is optimal; otherwise, other networks, such as hub and spoke are optimal. (2) Similarly, for very high demand rates, direct service is optimal; and for intermediate values, hub and spoke is optimal. (3) If the number of cities is small, direct service dominates; and if it is large, hub and spoke is optimal. We note that any airline's schedule includes safety time as a buffer against delays, and we demonstrate that schedule reliability is highest for direct routing. Surprisingly, the amount of time that is added to the schedule to buffer delays is relatively less in direct networks than in other networks. This can explain the superior on-time performance and high equipment utilization of direct carriers such as Southwest Airlines.
Fault tolerant supercomputing: a software approach
Authors: E. Verentziotis, T. Varvarigou, D. Vergados, G. Deconinck
Venue: Information processing and technology (2001)

Adding fault tolerance to embedded supercomputing applications is becoming an issue of great significance, especially as these applications support critical parts of our everyday life in the modern "Information Society". To this end, a software middleware framework is presented that features a collection of flexible and reusable fault tolerance modules acting at different levels and coping with common fault tolerance requirements. The burden of ad hoc fault tolerance programming is removed from the application developer, while at the same time average fault tolerance support taken at operating system level is avoided. A high-level description helps the developer specify the fault tolerance strategies of the application as a sort of second application layer; this separates functional from fault tolerance aspects of an application, shortening the development cycle and improving maintainability. Integration of this functionality in real embedded applications validates this approach.
An NLP & IR approach to topic detection
Authors: Hsin-Hsi Chen, Lun-Wei Ku
Venue: Topic detection and tracking: event-based information organization (2002)

This paper presents algorithms for Chinese and English-Chinese topic detection. Named entities, other nouns and verbs are cue patterns to relate news stories describing the same event. Lexical translation and name transliteration resolve lexical differences between English and Chinese. A two-threshold scheme determines relevance (irrelevance) between a news story and a topic cluster. Lookahead information deals with ambiguous cases in clustering. The least-recently-used removal strategy models the time factor in such a way that older and unimportant terms will have no effect on clustering. Experimental results show that nouns and verbs as well as the least-recently-used removal strategy outperform other models. The performance of the named-entity-only approach decreases slightly, but it has no overhead of nouns-and-verbs approach with the least-recently-used removal strategy.
Convergence of cascade algorithms in Sobolev spaces for perturbed refinement masks
Authors: Di-Rong Chen, Gerlind Plonka
Venue: Journal of Approximation Theory (2002)

In this paper, the convergence of the cascade algorithm in a Sobolev space is considered if the refinement mask is perturbed. It is proved that the cascade algorithm corresponding to a slightly perturbed mask converges. Moreover, the perturbation of the resulting limit function is estimated in terms of that of the masks.
Repeater insertion and wire sizing optimization for throughput-centric VLSI global interconnects
Authors: Harshit Shah, Pun Shiu, Brian Bell, Mamie Aldredge, Namarata Sopory
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

As technology advances towards billion transistor systems, the cost of complex wire networks will require area efficient wiring methodologies. This paper explores the tradeoffs between wire latency, throughput and area for deep submicron (DSM) interconnect technologies. From basic physical models, optimal wiring sizing for repeater networks are rigorously derived and compared to HSPICE simulations. Key case studies from 250nm to 70nm technologies reveal that significant wire area reduction (20--50%) can be achieved with optimal wire sizing to maximize the throughput per unit wire area.