ppxscal/embedding_network huggingface dataset:
Using assembly representations to enable evolutionary design of Lego structures
Authors: Maxim Peysakhov, William C. Regli
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2003)

This paper presents an approach to the automatic generation of electromechanical engineering designs. We apply messy genetic algorithm (GA) optimization techniques to the evolution of assemblies composed of LegoTM structures. Each design is represented as a labeled assembly graph and is evaluated based on a set of behavior and structural equations. The initial populations are generated at random, and design candidates for subsequent generations are produced by user-specified selection techniques. Crossovers are applied by using cut and splice operators at the random points of the chromosomes; random mutations are applied to modify the graph with a certain low probability. This cycle continues until a suitable design is found. The research contributions in this work include the development of a new GA encoding scheme for mechanical assemblies (Legos), as well as the creation of selection criteria for this domain. Our eventual goal is to introduce a simulation of electromechanical devices into our evaluation functions. We believe that this research creates a foundation for future work and it will apply GA techniques to the evolution of more complex and realistic electromechanical structures.
A Note on Test Oracles and Semantics of Algebraic Specifications
Authors: Hong Zhu
Venue: Proceedings of the Third International Conference on Quality Software (2003)

Algebraic testing is an automated software testingmethod based on algebraic formal specifications. It tests ifa program correctly implements an algebraic specificationby checking if the equations of the specification are satisfied.One of the key techniques of algebraic testing is theuse of observation contexts as a test oracle so that thecomparison of values of structured data can be realised bycomparing values of simple data types. This leads to abehavioural semantics of algebraic specifications anddivides sorts into observable and non-observable. To representthe structure of object-oriented programs and tofacilitate incremental integration testing, this paper extendsthe notion of observable sorts by introducing a partialordering between sorts to represent the importation relationbetween classes. In this framework, the validity of testoracles is formally proved in final algebra semantics.
A Context-Dependent Model of the Gambling Effect
Authors: Han Bleichrodt, Ulrich Schmidt
Venue: Management Science (2002)

This paper presents a context-dependent theory of decision under risk. The relevant contextual factor is the presence of a riskless lottery in a preference comparison. The theory only deviates from expected utility if the set of options contains both riskless and risky lotteries. The main motivation for the theory is to explain the gambling effect. Contrary to previous theories of the gambling effect, the present theory is consistent with stochastic dominance. It can, however, violate transitivity. The theory allows for a decomposition of the interaction between risk aversion and gambling aversion and thereby extends the classical Arrow-Pratt measure of risk aversion.
Perceived Performance in Internet Testing
Authors: Wm. Benjamin Martz,  Jr., Morgan M. Shepherd
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

With the growth of distance education, many issues pertaining to how students perform in thisenvironment are surfacing. The differences between the environments may have pedagogical implications on the basic activities in education such as assessment. This paper provides the results of comparing the testing process between two sections of a graduate programming class, where one was an on-campus class and the other a distance class. The course content, instructor, syllabus, lecture materials, notes, assessments and semester (time of year) were the same. Both groups were surveyed to test their satisfaction with the testing procedure and with their perception of certain aspects of the social environment. While there was no difference in actual test performance, the results showed differences in perceived test performance. Two conjectures about possible causes underlying the difference and suggestions for possible future research end the discussion.
MASCARET: Pedagogical Multi-Agents System for Virtual Environment for Training
Authors: Cédric Buche, Ronan Querrec, Pierre De Loor, Pierre Chevaillier
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

This study concerns virtual environments for trainingin operational conditions. The principal developed idea isthat these environments are heterogeneous and openmulti-agent systems. The MASCARET model is proposedto organize the interactions between agents and toprovide them reactive, cognitive and social abilities tosimulate the physical and social environment. Thephysical environment represents, in a realistic way, thephenomena that learners and teachers have to take intoaccount. The social environment is simulated by agentsexecuting collaborative and adaptive tasks. These agentsrealize, in team, procedures that they have to adapt to theenvironment. The users participate to the trainingenvironment through their avatar. In this article, weexplain how we integrated in MASCARET modelsnecessary to the creation of Intelligent Tutoring System.We notably incorporate pedagogical strategies andpedagogical actions. We present pedagogical agents. Tovalidate our model, the SECUREVI application for fire-fighterstraining is developed.
Facial animation by expression cloning
Authors: Ulrich Neumann
Venue:  (2002)

The face plays a vital role in human interactions. It provides a rich set of aural/visual cues to the listener/viewer. Speech facilitates a direct and succinct way to express a person's intent or knowledge aurally, while the face presents additional information visually. Producing human mouth movements for speech or facial expressions involves complicated muscle dynamics. Although a person makes little effort to orchestrate all the muscles to create facial expressions and mouth movements, it presents a challenging task to simulate the skin deformations and mechanical movements with a computer. A spectrum of approaches has been used to synthesize facial motions. At one extreme lie the completely physics-based approaches. At the other extreme lies an artistic skill that only manipulates the face surface. Due to the extensive computation, manual processes, or talent involved, the production cost can be very high. This thesis presents an alternative that minimizes the computational and manual costs while maintaining the accurate dynamics and visual quality of the facial motions produced by any available methods. Instead of creating new facial animations from scratch for each new model created, existing animation data in the form of vertex motion vectors are utilized. This approach allows animations created by any tools or methods to be easily retargeted to new models. This process is called expression cloning. Expression cloning makes it meaningful to compile a high quality facial animation library since these can be reused for new models. Expression cloning transfers each vertex motion vector from a source face model to a target model having possibly different geometric proportions and mesh structure (vertex number and connectivity). Since expression cloning works on existing animations, this thesis also describes a way to build a source animation, 2D visual speech synthesis, 3D direct surface deformations, and gesture driven facial animation. Radial basis functions, a network with one hidden layer, are employed as an underlying mechanism for all these tasks.
Space-time selective broadcast and receiver algorithms for frequency selective mimo systems
Authors: Jianzhong Zhang
Venue:  (2003)

In order to meet the diverse Quality of Service (QoS) requirements of new mobile applications in the adverse wireless channels, there are many challenges in various aspects of wireless networks, including transceiver designs that provide higher spectral efficiency in the physical layer and efficient wireless network resource allocation algorithms. In this thesis, we address and contribute new solutions to two important problems. First, we devise a space-time transceiver design that provides optimal signaling efficiency in a wireless broadcast environment. In this transceiver design, we jointly optimize the transmit signature code and receive filters in order to achieve the best power efficiency at the transmitter, while satisfying the Signal to Noise Ratio (SNR) requirements at different receivers. Second, we develop efficient space-time receivers for a frequency-selective multiple transmit, multiple receive antenna (MIMO) system that strives for higher information data rates. In these space-time receivers, the spatial and temporal dimensions are effectively decoupled in order to achieve desirable tradeoffs between algorithm performance and numerical complexity.
Managing the transition to bricks and clicks
Authors: C. Ranganathan, Vern Goode, Arkalgud Ramaprasad
Venue: Communications of the ACM (2003)

Egghead, a brick-and-mortar computer retailer, with stores across 200 locations, abandoned its brick establishments to become a pure Internet set-up, Egghead.com.<br><br>Charles Schwab was quick to react to the strategies of E*Trade and other competitors and moved its brokerage services to the Web. It gradually expanded its Web services to many areas, integrated its offline and online operations and became a brick-and-click set-up.<br><br>Through effective use of the Internet, UPS has been able to offer all of its services on the Web, as well as extend them. Apart from offering Web-based package tracking and delivery confirmation services, UPS offers document exchange service through which its business clients can transmit documents over the Net.
The temporal logic of coalgebras via Galois algebras
Authors: Bart Jacobs
Venue: Mathematical Structures in Computer Science (2002)

This paper introduces a temporal logic for coalgebras. Nexttime and lasttime operators are defined for a coalgebra, acting on predicates on the state space. They give rise to what is called a Galois algebra. Galois algebras form models of temporal logics like Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). The mapping from coalgebras to Galois algebras turns out to be functorial, yielding indexed categorical structures. This construction gives many examples, for coalgebras of polynomial functors on sets. More generally, it will be shown how &lsquo;fuzzy&rsquo; predicates on metric spaces, and predicates on presheaves, yield indexed Galois algebras, in basically the same coalgebraic manner.
A Graphical Environment to Query XML Data with XQuery
Authors: Daniele Braga, Alessandro Campi
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

XQuery, the standard query language for XML, is increasingly popular among computer scientists with a SQL background, since queries in XQuery and SQL require comparable skills to be formulated. However, the number of these experts is limited, and the availability of easierXQuery "dialects" could be extremely valuable.With this motivation in mind, we designed XQBE, a dialect of XQuery inspired by the QBE language (Query by Example). QBE, initially proposed as an alternative to SQL, has then become popular as the user-friendly query language supported by MS Access.XQBE starts from hierarchical structures, coherent with the hierarchical nature of XML, and uses one or more structures to denote the input documents, and one structure to denote the XML document produced in output. These structures are annotated to express selection predicates; explicit bindings connecting the nodes of these structures visualize the input/output mappings.
An Intelligent Early Warning System for Software Quality Improvement and Project Management
Authors: Xiaoqing (Frank) Liu, Gautam Kane, Monu Bambroo
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

One of the main reasons behind unfruitful software development projects is that it is often too late to correct the problems by the time they are detected. It clearly indicates the need for early warning about the potential risks. In this paper, we discuss an intelligent software early warning system based on fuzzy logic using an integrated set of software metrics. It helps to assess risks associated with being behind schedule, over budget, and poor quality in software development and maintenance from multiple perspectives. It handles incomplete, inaccurate, and imprecise information, and resolve conflicts in an uncertain environment in its software riskassessment using fuzzy linguistic variables, fuzzy sets, and fuzzy inference rules. Process, product, and organizational metrics are collected or computed based on solid software models. The intelligent risk assessment process consists of the following steps: fuzzification ofsoftware metrics, rule firing, derivation and aggregation of resulted risk fuzzy sets, and defuzzification of linguistic risk variables.
Improving link-state routing
Authors: Hyeonsang Eom
Venue:  (2003)

In link-state routing, routes are determined based on estimates of the current delays on the links. Ideally, a data packet should be routed based on the delays it will encounter at each link of the path at the time the packet gets to the link. To address this issue, we have developed a new approach that improves link-state routing by estimating and using the future link delays encountered by data packets. In link-state routing, link-delay estimates are periodically flooded throughout the network. This flooding of link-delay estimates is done without considering the relevance of these estimates to routing quality. Our approach also improves link-state routing by broadcasting these estimates only to the extent that they are relevant. Simulation studies suggest that our approach can lead to significant reductions in routing traffic with noticeable improvements of routing quality in high-load conditions. We have also studied the issue of improving the current link-delay estimation approach. To address this issue, we have developed a new link-delay estimation approach and provided guidance on this direction.
Benchmarketing Competition
Authors: Bob Colwell
Venue: Computer (2003)

Benchmarketing aims to make the benchmark numbers as high as possible, regardless of whether they actually have any predictive power.
A Regression Model for Fuzzy Initial Data
Authors: V. G. Domrachev, O. M. Poleshuk
Venue: Automation and Remote Control (2003)

A fuzzy combined linear regression model for fuzzy initial data, which are tolerant (L-R)-numbers with constraints on the functions L and R, is designed. The model is called combined since it is a combination of two regression models&mdash;a fuzzy model and a classical model. Its coefficients are determined as unimodal (L-R)-numbers. The solution method consists in determining weighted intervals for the tolerant (L-R)-numbers and then applying of the least-squares method.
An overset-grid method for 3D unsteady incompressible flows
Authors: H. S. Tang, S. Casey Jones, Fotis Sotiropoulos
Venue: Journal of Computational Physics (2003)

A composite-grid numerical method is developed for simulating unsteady, three-dimensional (3D), incompressible flows in complex geometries. The governing equations are solved using a second-order accurate, finite-volume method based on the dual time-stepping artificial compressibility approach. Overset grids are employed to discretize arbitrarily complex geometries, and a new interface algorithm is developed to facilitate communication between neighboring grids. The algorithm is inspired by the necessary and sufficient conditions for satisfying global mass conservation in a composite domain and is simple to implement in 3D. Numerical experiments show that the new interpolation scheme is superior to straightforward, trilinear interpolation of all flow variables as it minimizes non-physical spurious oscillations in the overlap region, is less sensitive to grid refinement, and greatly enhances the computational efficiency of the iterative algorithm. The advantages of the new method are especially pronounced when adjacent overset subdomains are discretized with different spatial resolutions. The potential of the method as a powerful technique for simulating complex engineering flows is demonstrated by applying it to calculate vortex shedding from a circular cylinder mounted between two endplates and flow in a rectangular channel with two wall-mounted obstacles.
Taking more of the soft out of software engineering
Authors: Tom Maibaum
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

Conventional engineering disciplines use engineering models which allow the practising engineer to avoid the intricacies and complications of conventional mathematics. These models underpin the everyday work of the engineer and have solid foundations in science and the underlying mathematical theory. We discuss whether software engineering has developed corresponding engineering models and come to the conclusion that this has not yet happened. The reasons turn out to be different for programming in the small and programming in the large. The issue is of crucial importance in redirecting the efforts of researchers and practitioners interested in software engineering joining the brotherhood of mature engineering disciplines.
Locating human faces within images
Authors: A. Z. Kouzani
Venue: Computer Vision and Image Understanding (2003)

This paper presents an intelligent system to locate human faces within images. The proposed system can handle facial pattern variations due to certain changes in pose, illumination, and expression, as well as existence of spectacles, facial-hair, and occlusion. The system consists of three modules: preprocessing, face-components extraction, and final decision-making. In the first module, image processing algorithms are performed on images captured by cameras. Face components are extracted in the second module. A fuzzy neural network-based algorithm is designed for this purpose. In the last module, a commonsense-knowledge base is used for final evaluation of the identified features and determination of the face locations. The performance of the system is evaluated by conducting experiments on seven large test sets.
An adaptive timestepping algorithm for stochastic differential equations
Authors: H. Lamba
Venue: Journal of Computational and Applied Mathematics (2003)

We introduce a variable timestepping procedure using local error control for the pathwise (strong) numerical integration of a system of stochastic differential equations forced by a single Wiener process. The Milstein method is used to advance the numerical solution and the stepsizes are determined via two local error estimates that roughly correspond to leading order deterministic and stochastic local error components. One advantage of using two error controls is an increased flexibility that allows for the treatment of both drift and diffusion dominated regimes in a consistent manner. Numerical results are presented and the generalization of this approach to wider classes of problems and methods is discussed.
Language support for data parallelism in pointer based dynamic data structures
Authors: Pankaj Kumar
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

To date, most of the work on language support for data parallelism has been largely limited to static data structures such as arrays. In 'C' or C++, the use of pointers and dynamic memory allocators provide the ability to handle more complex data structures whose size and shape may vary over the course of the computation. There are two main issues with regards to supporting data parallelism on pointerbased dynamic data structures without having the programmer worry about synchronization, data distribution and load balancing.Firstly, how do we write programs that traverse the data structure in parallel.Secondly, since the pointer based dynamic data structures are incrementally built by the use of dynamic memory allocators, the implementation on distributed memory multiprocessors must support on-the-fly data distribution and load balancing.We have extended the 'C' language with a new data type called "Troupe" and a corresponding "for each" statement. These constructs provide support for (nested) data parallel operations on data elements which unlike arrays may be of different types and have no known storage pattern. This paper discusses the proposed extensions to 'C ' and presents examples to show how these constructs can be used for managing and expressing data parallelism on pointer based dynamic data structures.
Interface design for mobile commerce
Authors: Young Eun Lee, Izak Benbasat
Venue: Communications of the ACM (2003)

Understanding the unique characteristics of m-commerce to enhance and improve the user interface.
3D motion retrieval with motion index tree
Authors: Feng Liu, Yueting Zhuang, Fei Wu, Yunhe Pan
Venue: Computer Vision and Image Understanding (2003)

With the development of Motion capture techniques, more and more 3D motion libraries become available. In this paper, we present a novel content-based 3D motion retrieval algorithm. We partition the motion library and construct a motion index tree based on a hierarchical motion description. The motion index tree serves as a classifier to determine the sub-library that contains the promising similar motions to the query sample. The Nearest Neighbor rule-based dynamic clustering algorithm is adopted to partition the library and construct the motion index tree. The similarity between the sample and the motion in the sub-library is calculated through elastic match. To improve the efficiency of the similarity calculation, an adaptive clustering-based key-frame extraction algorithm is adopted. The experiment demonstrates the effectiveness of this algorithm.
Negoisst: a negotiation support system for electronic business-to-business negotiations in e-commerce
Authors: Mareike Schoop, Aida Jertila, Thomas List
Venue: Data Knowledge Engineering (2003)

Electronic negotiations can range from simple offer exchanges to complex communicative acts concerning packages of products and services. In contrast to dominant approaches aiming at automating the negotiation process (e.g. auction models), we introduce the notion of negotiation support for human negotiators conducting complex electronic negotiations. The negotiation support system Negoisst for business-to-business electronic commerce is presented that is based on theories of communication and information systems and that combines communication and document management. Negoisst has been successfully validated for e-negotiations in the construction industry.
Sizing Consideration for Leakage Control Transistor
Authors: F. Farbiz, M. Farazian, M. Emadi, K. Sadeghi
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

In this paper, we report the use of the GeneticAlgorithm (GA) to determine the optimum size of theleakage control transistor for low power applications. Inthe optimization, the energy-delay product is minimized.The transistor is modeled by a neural network to increasethe speed and the accuracy of the calculations.