ppxscal/embedding_network huggingface dataset:
Universality and chaos for tensor products of operators
Authors: Félix Martínez-Giménez, Alfredo Peris
Venue: Journal of Approximation Theory (2003)

We give sufficient conditions for the universality of tensor products {Tn, ~ Rn : n ∈ N} of sequences of operators defined on Fréchet spaces. In particular we study when the tensor product T ~ R of two operators is chaotic in the sense of Devaney. Applications are given for natural operators on function spaces of several variables, in Infinite Holomorphy, and for multiplication operators on the algebra L(E) following the study of Kit Chan.
Portfolio Selection Theory with Different Interest Rates for Borrowing and Leading
Authors: Shunming Zhang, Shouyang Wang, Xiaotie Deng
Venue: Journal of Global Optimization (2004)

This paper considers the portfolio selection problem with different interest rates for borrowing and leading. The portfolio frontier is described under the general condition that the riskless borrowing rate is higher than the riskless lending rate.
Agent-oriented simulation
Authors: Adelinde Uhrmacher, William Swartout
Venue: Applied system simulation: methodologies and applications (2003)

Metaphors play a key role in computer science and engineering. Agents bring the notion of locality of information (as in object-oriented programming) together with locality of intent or purpose. The relation between multi-agent and simulation systems is multi-facetted. Simulation systems are used to evaluate software agents in virtual dynamic environments. Agents become part of the model design, if autonomous entities in general, and human or social actors in particular shall be modeled. A couple of research projects shall illuminate some of these facets.
Visualization schemes for domain novices exploring a topic space: the navigation classification scheme
Authors: John E. Leide, Andrew Large, Jamshid Beheshti, Martin Brooks, Charles Cole
Venue: Information Processing and Management: an International Journal (2003)

In this article and two other articles which conceptualize a future stage of the research program (Leide, Cole, Large, & Beheshti, submitted for publication; Cole, Leide, Large, Beheshti, & Brooks, in preparation), we map-out a domain novice user's encounter with an IR system from beginning to end so that appropriate classification-based visualization schemes can be inserted into the encounter process. This article describes the visualization of a navigation classification scheme only. The navigation classification scheme uses the metaphor of a ship and ship's navigator traveling through charted (but unknown to the user) waters, guided by a series of lighthouses. The lighthouses contain mediation interfaces linking the user to the information store through agents created for each. The user's agent is the cognitive, model the user has of the information space, which the system encourages to evolve via interaction with the system's agent. The system's agent is an evolving classification scheme created by professional indexers to represent the structure of the information store. We propose a more systematic, multidimensional approach to creating evolving classification/indexing schemes, based on where the user is and what she is trying to do at that moment during the search session.
Knowledge management enablers within an IT department
Authors: Hope Koch, David Paradice, Yi Guo, Bongsug Chae
Venue: Advanced topics in information resources management (2003)

In today's competitive global economy, characterized by shorter product lifecycles, increased employee turnover and ubiquitous information technologies, an organization's ability to manage knowledge may be the only remaining source of competitive advantage (Drucker, 1995, 1999; Kogut & Zander, 1992; Nonaka, 1994; Winter, 1987). Even though a number of researchers have outlined the importance of adopting knowledge management (KM) practices and many organizations have given lip service to the term, there is still some ambiguity concerning what KM actually is (Malhotra, 2000b), and little attention has been paid to factors that enable effective KM to occur (Nonaka & Takeuchi, 1995). This research uses technical and human-centric approaches combined with Holsapple and Joshi's (1998, 2001) Kentucky Initiative to investigate KM within an information technology (IT) department. Based on our case study, modifications to Holsapple and Joshi's architecture of a KM episode, a model of execution of knowledge manipulation activities and a model outlining factors enabling effective KM are proposed.
Producing a real-world student group project
Authors: Pam Hogarth, Gil Zimmerman, Craig Sylvester, Kat Curry
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

Many Digital Media/Animation departments include student group projects as an important component of their curriculums. Gnomon School of Visual Effects has worked hard to make our group projects real-world projects. The latest of these was creating the visual effects for the Roger Corman feature film Demonslayer. These real-world projects offer our students unusual opportunities and challenges.This session will feature presentations by the Visual Effects Supervisor, Visual Effects Producer, CG Supervisor and students involved in the project. Topics to be covered will include the history of Demonslayer, the pluses and problems, working with professionals, setting realistic expectations and suggestions for finding projects.
An aggregate weld product model for the early design stages
Authors: Z. Yao, H. D. Bradley, P. G. Maropoulos
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

Existing product models do not adequately support the modelling of weld products during the early design stages. A newly developed aggregate product model for welding is introduced, which forms part of CAPABLE, a concurrent engineering toolkit for machining and welding. This product model supports the representation of the design at multiple levels of detail and allows the rapid modelling of alternative designs where solid model representation is inappropriate. The potential applications of the aggregate product model in weld product design, such as the integration of joint design and weldability assessment, are discussed using simple examples. The design of weld products must consider process-dependent properties including geometry, materials combinations, and weld joint characteristics to arrive at a near-optimal configuration. The object-oriented and feature-based model structure of CAPABLE enhances the design process by the automatic generation of compatible options and allows rapid design evaluation. The aggregate product model provides the input data necessary for tasks like process selection, optimization, process sequencing, fixture design and welding orientation selection. The main advantage of this product model over traditional CAD environments is that planning of the welding and fabrication operations can start during the conceptual and embodiment stages of the design process, thus ensuring the concurrency of design and planning tasks and resulting in product and process improvement and cost reduction.
Slot grammars
Authors: Michael C. McCord
Venue: Computational Linguistics (1980)

This paper presents an approach to natural language grammars and parsing in which slots and rules for filling them play a major role. The system described provides a natural way of handling a wide variety of grammatical phenomena, such as WH-movement, verb dependencies, and agreement.
The science of images: a cross-disciplinary introduction to the field of 3-D computer graphics
Authors: Dalton Hunkins, David B. Levine
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

Students choosing to specialize in the study of computer graphics often come from two disparate groups - the mathematically-inclined students who are often most interested in the computer programming aspects of the field, and the artistically-inclined students whose interest lies more in design and image construction. If these two groups are to learn as part of one community, they need to develop (at least) a common background and language. This paper presents an approach to achieving this goal and discusses a particular course, The Science of Images, which has been taught for several years in this pursuit.
Device Reliability and Failure Mechanisms Related to Gate Dielectrics and Interconnects
Authors: M. K. Radhakrishnan
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

As dimensions shrink, the reliabilityconsiderations become more trivial. Indeep sub-micron devices, at certain stagesof processing, even an atomic layervariation can be a defect. Studies on thephysical failure mechanisms in sub-microndevices reveals that the major reliabilityconcerns are the same as that poses beforescaling. A comprehensive overview on thereliability issues in ultra thin gatedielectrics and copper interconnectmaterial is given to link how the physicaleffects on devices can be a threat to long-termreliability.
H&infin; Reliable Control of Uncertain Linear State Delayed Systems
Authors: Zidong Wang, Hong Qiao
Venue: Journal of Dynamical and Control Systems (2004)

This paper deals with the problem of robust and reliable H&infin; control design for linear uncertain time-delay systems with time-varying norm-bounded parameter uncertainty, and also with actuator failures among a specified subset of actuators. A state feedback control design is presented that stabilizes the plant and guarantees an H&infin;-norm bound constraint on attenuation of the augmented disturbances, including failure signals, for all admissible uncertainties as well as actuator failures. It is shown that the existence of the desired controllers is related to the positive definite solution of a parameter-dependent Riccati-like matrix equation, whose solving algorithm is also discussed in detail. Two illustrative examples are provided to demonstrate the applicability of the proposed method.
Kriging as a surrogate fitness landscape in evolutionary optimization
Authors: Alain Ratle
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

The problem of finding optimal values in complex parameter optimization problems has often been solved with success by evolutionary algorithms (EAs). In many cases, these algorithms are employed as black-box methods over imprecisely known domains. Such problems arise frequently in engineering design. The principal barrier to the general use of EAs for those problems is the huge number of function evaluations that is often required. This makes EAs an impractical approach when the function evaluation depends on numerically heavy design analysis tools, for example, finite elements methods. This paper presents the use of kriging interpolation as a function approximation method for the construction of an internal model of the fitness landscape. This model is intended to guide the search process with a reduced number of fitness function evaluations.
Fast memory bank assignment for fixed-point digital signal processors
Authors: Jeonghun Cho, Yunheung Paek, David Whalley
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2004)

Most vendors of digital signal processors (DSPs) support a Harvard architecture, which has two or more memory buses, one for program and one or more for data and allow the processor to access multiple words of data from memory in a single instruction cycle. Also, many existing fixed-point DSPs are known to have an irregular architecture with heterogeneous registers, which contains multiple register files that are distributed and dedicated to different sets of instructions. Although there have been several studies conducted to efficiently assign data to multimemory banks, most of them assumed processors with relatively simple, homogeneous general-purpose registers. Thus, several vendor-provided compilers for DSPs that we examined were unable to efficiently assign data to multiple data memory banks, thereby often failing to generate highly optimized code for their machines. As a consequence, programmers for these DSPs often manually assign program variables to memories so as to fully utilize multimemory banks in their code. This paper reports on our recent attempt to address this problem by presenting an algorithm that helps the compiler to efficiently assign data to multimemory banks. Our algorithm differs from previous work in that it assigns variables to memory banks in separate, decoupled code generation phases, instead of a single, tightly coupled phase. The experimental results have revealed that our decoupled algorithm greatly simplifies our code generation process; thus our compiler runs extremely fast, yet generates target code that is comparable in quality to the code generated by a coupled approach.
Software engineering concepts for multimedia development
Authors: Dawn Cizmar
Venue: ACM SIGCSE Bulletin (2003)

This presentation reports results, experience and ongoing efforts to teach software engineering skills to developers of instructional technology. Software engineering concepts were presented to faculty who had little prior experience with computer science or system development techniques. These faculty planned to develop technology enhancements for their courses, requiring multimedia and other implementation skills. Analyzing the experiences later led to several projects to address the lack of knowledge and effective practice among faculty and other developers, including professional staff and students.
Specification of business components using temporal OCL
Authors: Stefan Conrad, Klaus Turowski
Venue: UML and the unified process (2003)

Compositional, plug-and-play-like reuse of black box components requires sophisticated techniques to specify components, especially when combined with third party components that are traded on component markets to individual customer's business application systems. As in established engineering disciplines, like mechanical engineering or electrical engineering, formal documentation of business components that become part of contractual agreements are needed. With this initial problem, we explain the general, layered structure of software contracts for business components and show shortcomings of common specification approaches. Furthermore, we introduce a formal notation for the specification of business components that extends the Object Constraint Language (OCL) and allows for a broader use of the Unified Modeling Language (UML) with respect to the layered structure of software contracts for business components.
Pupil consultation online: developing a web-based questionnaire system
Authors: Scott Milne, Lorna Gibson, Peter Gregor, Ken Keighren
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

The idea of consulting pupils about developments in their schools is now established in legislation and practice in schools. While many methods of performing such consultations have been employed for a number of years, a new system has been developed which can offer a consultation environment previously not available. An online pupil consultation system for use in schools throughout Fife Council is designed so that staff members can build questionnaires, allow pupils to complete them anonymously and finally analyse the results in collated form.
Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks
Authors: Hyung Seok Kim, Tarek F. Abdelzaher, Wook Hyun Kwon
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

Data dissemination from sources to sinks is one of the main functions in sensor networks. In this paper, we propose SEAD, a Scalable Energy-efficient Asynchronous Dissemination protocol, to minimize energy consumption in both building the dissemination tree and disseminating data to mobile sinks. SEAD considers the distance and the packet traffic rate among nodes to create near-optimal dissemination trees. The sinks can move without reporting their location to the tree while receiving data updates successfully. Our evaluation results illustrate that SEAD consumes less energy on building and maintaining a dissemination tree to multiple mobile sinks compared to other approaches such as directed diffusion, TTDD, and mobile ad hoc multicast.
Interactive Multimodal User Interfaces for Mobile Devices
Authors: Wolfgang Mueller, Robbie Schaefer, Steffen Bleul
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Portable devices come with different limitations in user interaction like limited display size, small keyboard, and different sorts of input and output capabilities. With the advance of speech recognition and speech synthesis technologies, their complementary use becomes attractive for mobile devices in order to implement real multimodal user interaction. However, current systems and formats do not sufficiently integrate advanced multimodal interactions.We introduce an advanced generic Multimodal Interaction and Rendering System (MIRS) dedicated for mobile devices. MIRS incorporates efficient processing of XML specification languages for limited, mobile devices and comes with the XML-based Dialog and Interface Specification Language (DISL). DISL can be considered as an UIML subset, which is enhanced by the means of state-oriented dialog specifications. The dialog specification is based on ODSN (Object Oriented Dialog Specification Notation), which has been introduced to define User Interface control by means of interaction states with transition rules.
Load Balancing of Autonomous Actors over Dynamic Networks
Authors: Travis Desell, Kaoutar El Maghraoui, Carlos Varela
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

The Internet is constantly growing as a ubiquitous platform for high-performance distributed computing. In this paper, we propose a new software framework for distributed computing over large scale dynamic and heterogeneous systems. Our framework wraps computation into autonomous actors, self organizing computing entities, which freely roam over the network to find their optimal target execution environments.We introduce the architecture of our worldwide computing framework, which consists of an actor-oriented programming language (SALSA), a distributed run time environment (WWC), and a middleware infrastructure for autonomous reconfiguration and load balancing (IO). Loadbalancing is completely transparent to application programmers. The middleware triggers actor migration based on profiling resources in a completely decentralized manner. Our infrastructure also allows for the dynamic addition and removal of nodes from the computation, while continuously balancing the load given the changing resources.To balance computational load, we introduce three variations of random work stealing: load-sensitive (RS), actor topology-sensitive (ARS), and network topology-sensitive (NRS) random stealing. We evaluated RS and ARS with several actor interconnection topologies in a local area network. While RS performed worse than static round-robin (RR) actor placement, ARS outperformed both RS and RR in the sparse connectivity and hypercube connectivity tests, by a full order of magnitude.
The CPR model for summarizing video
Authors: M. Fayzullin, V. S. Subrahmanian, A. Picariello, M. L. Sapino
Venue: Proceedings of the 1st ACM international workshop on Multimedia databases (2003)

Most past work on video summarization has been based on selecting key frames from videos. We propose a model of video summarization based on three important parameters: Priority (of frames), Continuity (of the summary), and non-Repetition (of the summary). In short, a summary must include high priority frames, must be continuous and non-repetitive. An optimal summary is one that maximizes an objective function based on these three parameters. We develop formal definitions of all these concepts and provide algorithms to find optimal summaries. We briefly report on the performance of these algorithms.
CS1 assessment using memory diagrams
Authors: Mark A. Holliday, David Luginbuhl
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

Understanding the execution of an object-oriented program can be a challenge for a student starting a CS1 course. We believe that a type of diagram that we call a memory diagram can aid the student in understanding object-oriented programming and can assist the instructor in assessing the student's understanding.Memory diagrams focus on how, in an abstract sense, the memory of the machine changes as the program executes. Though memory diagrams are a simple idea, by careful use of shape and placement, a number of key points about the meaning of a program fragment can be conveyed visually. We have found a correlation between a student's ability to construct these diagrams and that student's comprehension of object-oriented concepts. We feel that this correlation indicates that memory diagrams can be used as an assessment technique that, in turn, can be used to improve student learning.
Pure type systems with explicit substitution
Authors: Roel Bloo
Venue: Mathematical Structures in Computer Science (2001)

We define an extension of pure type systems with explicit substitution. We show that the type systems with explicit substitution are strongly normalizing iff their ordinary counterparts are. Subject reduction is shown to fail in general but a weaker, though still useful, subject reduction property is established. A more complicated extension is proposed for which subject reduction does hold in general.
Markov Edit Distance
Authors: Jie Wei
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--Edit distance was originally developed by Levenstein several decades ago to measure the distance between two strings. It was found that this distance can be computed by an elegant dynamic programming procedure. The edit distance has played important roles in a wide array of applications due to its representational efficacy and computational efficiency. To effect a more reasonable distance measure, the normalized edit distance was proposed. Many algorithms and studies have been dedicated along this line with impressive performances in recent years. There is, however, a fundamental problem with the original definition of edit distance that has remained elusive: its context-free nature. In determining the p ossible actions, i.e., insertion, deletion, and substitution, no systematic consideration was given to the local behaviors of the string/pattern in question that indeed encompass great amount of useful information regarding its content. In this paper, inspired by the success of the Markov Random Field theory, a new edit distance called Markov edit distance (MED) within the dynamic programming framework is proposed to take full advantage of the local statistical dependencies in the pattern in order to arrive at enhanced matching performance. Within this framework, two specialized distance measures are developed: The reshuffling MED to handle cases where a subpattern in the target pattern is the reshuffles of that in the source pattern, and the coherence MED which is able to incur local content based substitution, insertion, and deletion. The applications based on these two MEDs in string matching are then explored, whereof encouraging empirical results have been observed.
Almost all graphs with average degree 4 are 3-colorable
Authors: Dimitris Achlioptas, Cristopher Moore
Venue: Journal of Computer and System Sciences (2003)

We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree d ≤ 4.03, i.e., G(n,p = d/n), are 3-colorable and that a constant fraction of all 4-regular graphs are 3-colorable.