ppxscal/embedding_network huggingface dataset:
View management for distributed user interfaces
Authors: Steven Feiner
Venue:  (2005)

We present a new approach to designing user interfaces based on view management. View management refers to layout decisions that determine spatial relationships between objects, taking into account visibility constraints that allow applications to man age what users see. Our techniques are used to satisfy these constraints by controlling what is seen in a wide range of user interfaces: from 2D desktops to 3D immersive environments, from view-only presentations to interactive techniques, and from single user to collaborative situations. Screen space is a difficult resource to utilize properly in user interfaces. Poorly designed user interfaces, consisting of overlapping windows, unwanted popups, and unused screen space, occur on many different types of displays, such as PDAs, laptops, cell phones, and wall-sized displays. We avoid these problems by providing techniques for representing and managing unused screen space to avoid overlapping when possible. Applying these techniques to 3D user interfaces imposes visual constraints on the placement of objects, such as labels and annotations, relative to the 2D visible projections of 3D objects on the view plane. We develop techniques to handle issues such as performance and temporal stabilization, and we create guidelines to help ensure that labels and annotations behave well across a wide range of situations. We have applied our techniques to augmented reality, in which information is visualized directly within the context of the real world by overlaying graphics onto what is seen. We develop tools, including an annotated situation-awareness aid based on a world in miniature , that make it easy to visualize information about the environment, including parts of the environment that might not be completely visible from their current location. We extend these ideas further into distributed interactive environments. In a world encompassing a wide range of display technologies, we are interested in how people will access, use, and interact with information and each other. All of this work presented has been developed (or redeveloped) using an efficient rule-based programming technique we call Data Programming , which is designed for standalone and distributed development and has given us the flexibility to investigate a wide range of scenarios in these environments.
Multi-objective evolutionary algorithms for ecological process models
Authors: Rie Komuro
Venue:  (2005)

Fitting an ecological process model to a set of data is frequently done by minimizing the residual sum of squares (RSS) between data and model output. However, we may need to consider many component elements of an ecological process when simulating a model rather than just one, and the RSS may not be an appropriate metric for simulation assessment. For this dissertation, a multi-objective Evolutionary Algorithm (EA) was used to fit a complex ecological process model. As an example, a model of successive hourly shoot growth of a forest tree was used. First, single-objective methods were tried with the RSS; however, the simulation results did not capture the measured data well, especially contraction periods. The current simulated growth is affected by that of the previous hours because the model includes a regression term. Thus, the fitting result could be improved if there was information about the relation between each data. The multi-objective optimization method allows us to consider contraction and extension periods separately, and these are an important phenomenon in shoot growth. Since we can set more than one objective function, each focused on particular data features. Also, if there is difficulty in achieving some criteria at the same time, analysis of differential effectiveness in capturing contraction and extension, if it occurs, could help to find what and where the deficiency of the model is. These effects of considering more than one objective function motivated using a multi-objective optimization method. Since the model is complex, many objective functions were required. I implemented elitism, a process to keep the best individuals to the next generations, but this needed to be different from that used in other EAs and obtained the following results: (1) crossover mutation rate should be determined dynamically for an efficient search; (2) from analysis of the results, deficiencies of the model were identified; (3) with the revised model, accuracy of achievement at contraction periods was improved; (4) the model reduced bias, but the error did not become small; more biological information about contraction and expansion is needed.
Formal object oriented design and analysis
Authors: Anastasia Marie Tircuit
Venue:  (2005)

Our research has resulted in developing a general framework for object-oriented design and design analysis. This framework includes an OO design notation and a method for developing design analyses. The notation provides a formal way to express OO designs. The elements of the notation are precisely defined in their meaning and function. Our notation for behavioral design is also unique in that it was developed in accordance with OO principles such as information hiding and modularity. Having modular designs facilitates the development of large systems in less complex ways and allows elements of the designs to be reused. The analysis element of our formal framework defines a method of developing design analysis properties. These properties will each state a condition or rule in order to have a well formed design. The properties are independent of each other and the design notation. New properties can be added at any time, without affecting the design and the existing analysis properties. The properties also maintain the formality of the design notation. They are unambiguous in their purpose and function. The formality of the notation and analysis properties acts as the basis for the automated analysis system. We illustrate the feasibility of our formal framework with the development of an automated design analysis system. The system takes an OO design as input, and stores it in an internal data structure. Once this data structure is built, it may be analyzed with any of the implemented analysis properties. We have suggested a procedure for translating an analysis property into an implementation. Using this procedure, we have implemented several example analysis properties. In accordance with the formal framework, new analysis properties may be added to the system at any time, without affecting the existing analyses.
A location model for ambient intelligence
Authors: Ichiro Satoh
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

We present a world model for location-aware and user-aware services in ubiquitous computing environments. It can be dynamically organized like a tree based on geographical containment, such as in that a user-room-floor-building hierarchy and each node in the tree can be constructed as an executable software component. The model is unique to existing approaches because it enables location-aware services to be managed without databases, can be managed by multiple computers, and provides a unified view of the locations of not only physical entities and spaces, including users and objects, but also computing devices and services. A prototype implementation of this approach was constructed on a Java-based mobile agent system. This paper presents the rationale, design, implementation, and applications of the prototype system.
Guide to LaTeX, 4th edition
Authors: Helmut Kopka, Patrick W. Daly
Venue:  (2003)

LaTeX is the text-preparation system of choice for scientists and academics, and is especially useful for typesetting technical materials. This popular book shows you how to begin using LaTeX to create high-quality documents. The book also serves as a handy reference of all LaTeX users. In this completely revised edition, the authors cover the LaTeX2 standard and offer more details, examples, exercises, tips, and tricks. They go beyond the core installation to describe the key contributed packages that have become essential to LaTeX processing.
Optimal assignment kernels for attributed molecular graphs
Authors: Holger Fröhlich, Jörg K. Wegner, Florian Sieker, Andreas Zell
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We propose a new kernel function for attributed molecular graphs, which is based on the idea of computing an optimal assignment from the atoms of one molecule to those of another one, including information on neighborhood, membership to a certain structural element and other characteristics for each atom. As a byproduct this leads to a new class of kernel functions. We demonstrate how the necessary computations can be carried out efficiently. Compared to marginalized graph kernels our method in some cases leads to a significant reduction of the prediction error. Further improvement can be gained, if expert knowledge is combined with our method. We also investigate a reduced graph representation of molecules by collapsing certain structural elements, like e.g. rings, into a single node of the molecular graph.
The impact of software engineering research on modern progamming languages
Authors: Barbara G. Ryder, Mary Lou Soffa, Margaret Burnett
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2005)

Software engineering research and programming language design have enjoyed a symbiotic relationship, with traceable impacts since the 1970s, when these areas were first distinguished from one another. This report documents this relationship by focusing on several major features of current programming languages: data and procedural abstraction, types, concurrency, exceptions, and visual programming mechanisms. The influences are determined by tracing references in publications in both fields, obtaining oral histories from language designers delineating influences on them, and tracking cotemporal research trends and ideas as demonstrated by workshop topics, special issue publications, and invited talks in the two fields. In some cases there is conclusive data supporting influence. In other cases, there are circumstantial arguments (i.e., cotemporal ideas) that indicate influence. Using this approach, this study provides evidence of the impact of software engineering research on modern programming language design and documents the close relationship between these two fields.
Enhanced Eyes for Better Gaze-Awareness in Collaborative Mixed Reality
Authors: Keisuke Tateno, Masayuki Takemura, Yuichi Ohta
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

The concept of "enhanced eyes" to restore gaze awareness in a collaborative mixed-reality space is proposed. Three "enhanced eyes" schemes are described: controlling the highlight in the eyes to aid awareness of eye contact, deforming the eyelids to enhance eye motion, and adjusting the rotation angle of the eyeballs to improve perception of gaze direction. The effectiveness of the schemes has been confirmed by subjective evaluations. The "enhanced eyes" emulate the natural appearance of the face and are effective not only to indicate gaze direction but also to create the feeling of gaze.
M^2 DR: A Near-optimal Multiclass Minimum-delay Routing Algorithm for Smart Radio Access Networks
Authors: Matthias Hollick, Parag S. Mogre, Tronje Krop, Hans-Peter Huth, Jens B. Schmitt, Ralf Steinmetz
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Today, we witness a transformation of radio access network topologies from strictly tree-structured towards meshed architectures. Yet, these edge networks follow mostly circuit-switched paradigms to support quality of service applications such as voice or video communication. In this work, we develop a novel quality of service aware routing framework to optimize the performance of edge networks in the packet-switched domain. Starting from the Internet's best-effort routing paradigm and building on related work, we formulate a near-optimal multiclass minimum-delay routing algorithm. Our algorithm optimizes network-wide end-to-end delay and allows for differentiation of service. We exploit two orthogonal dimensions namely multipath routing and class-based service prioritization. We provide a precise description of our algorithm and a detailed experimental analysis against state of the art routing algorithms. Our algorithm is able to achieve excellent performance while maintaining the simplicity of a decentralized and distributed routing algorithm, thus matching the requirements for future radio access networks.
Continuum Computer Architecture for Nano-Scale and Ultra-High Clock Rate Technologies
Authors: Thomas Sterling, Maciej Brodowicz
Venue: Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems (2005)

Continuum Computer Architecture (CCA) is a non-von Neumann architecture that offers an alternative to conventional structures as digital technology evolves towards nano-scale and the ultimate flat-lining of Moore's Law. Coincidentally, it also defines a model of architecture particularly well suited to logic classes that exhibit ultra-high clock rates (> 100 GHz) such as Rapid Single Flux Quantum (RSFQ) gates. CCA eliminates the concept of the "CPU" that has dominated computer architecture since its inception more than half a century ago and establishes a new local element that merges the properties of state storage, state transfer, and state operation. A CCA system architecture is a simple multidimensional organization of these elemental blocks and physically may be considered as a new family of cellular computer. But CCA differs dramatically from conventional cellular automata. While both deliver emergent global behavior from the aggregation of local rules and ensuing operation, The CCA emergent behavior is a global general-purpose model of parallel computation, as opposed to simply mimicking some limited phenomenon like heat and mass transfer as do conventional cellular automata. This paper presents the motivation and foundation concepts of CCA and exposes key issues for further work.
A pipeline architecture for computing the Euler number of a binary image
Authors: Arijit Bishnu, Bhargab B. Bhattacharya, Malay K. Kundu, C. A. Murthy, Tinku Acharya
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2005)

Euler number of a binary image is a fundamental topological feature that remains invariant under translation, rotation, scaling, and rubber-sheet transformation of the image. In this work, a run-based method for computing Euler number is formulated and a new hardware implementation is described. Analysis of time complexity and performance measure is provided to demonstrate the efficiency of the method. The sequential version of the proposed algorithm requires significantly fewer number of pixel accesses compared to the existing methods and tools based on bit-quad counting or quad-tree, both for the worst case and the average case. A pipelined architecture is designed with a single adder tree to implement the algorithm on-chip by exploiting its inherent parallelism. The architecture uses O(N) 2-input gates and requires O(NlogN) time to compute the Euler number of an N × N image. The same hardware, with minor modification, can be used to handle arbitrarily large pixel matrices. A standard cell based VLSI implementation of the architecture is also reported. As Euler number is a widely used parameter, the proposed design can be readily used to save computation time in many image processing applications.
Timing Performance Control in Web Server Systems Utilizing Server Internal State Information
Authors: Xue Liu, Rong Zheng, Jin Heo, Qixin Wang, Lui Sha
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

How to effectively allocate system resource to meet the Service Level Agreement (SLA) of Web servers is a challenging problem. In this paper, we propose an improved scheme for autonomous timing performance control in Web servers under highly dynamic traffic loads. We devise a novel delay regulation technique called Queue Length Model Based Feedback Control utilizing server internal state information to reduce response time variance in presence of bursty traffic. Both simulation and experimental studies using synthesized workloads and real-world Web traces demonstrate the effectiveness of the proposed approach.
Design and development of a mobile learning management system adaptive to learning style of students
Authors: Hyungsung Park
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

In this paper, I suggest applying adaptive technique to build educational systems. On the basis of prevailing E-learning Web platforms, a mobile platform could be used as a new educational environment. It is a mobile learning management system adaptive to students' learning styles, using a mobile learning environment and unique characteristics of mobile equipments. Through this system, I expect to set adaptive environment to individual learners on the ground of learning style, one of learners' variables.
A Preemptive Scheduling Algorithm for Wireless Real-Time On-Demand Data Broadcast
Authors: Xiao Wu, Victor C. S. Lee, Joseph Kee-Yin Ng
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

On-demand broadcast is an attractive data dissemination method for mobile and wireless computing. In this paper, we propose a new online preemptive scheduling algorithm, called PRDS that incorporates the urgency, the data size and the number of pending requests for real-time on-demand broadcast system. Furthermore, we use pyramid preemption to optimize performance and reduce overhead. We have done a series of simulation experiments to evaluate the performance of our algorithm as compared with other previously proposed methods under a range of scenarios. The experimental results show that our algorithm can substantially outperform other algorithms without jeopardizing other performance metrics, such as response time and stretch.
Report on selected readings on digital computer simulation
Authors: Vladimir Bazjanac
Venue: ACM SIGSIM Simulation Digest (1973)

The title of this text immediately reveals who it is written for: architects who are interested in computer applications. The author is assuming that the general reader in the field of architecture has absolutely no background in the field of computing and the text is therefore written on a very low level of sophistication, at which the simplicity is exaggerated. Though the text as a whole is probably helpful for an uninformed reader to learn about applications of computers to architecture, a more sophisticated reader will find reading of all but a few sections a waste of time. For a person with specific interests in the field of architecture and computer applications, those few more successful parts are probably quite worth reading, if for nothing else, then just for exposure to what is actually being done in that area. Besides that, an uninformed reader may find it interesting to get exposure to British hardware and ALGOL-based programming practice, as well as British terminology.
MP SoCs Including Optical Interconnect. Technological Progresses and Challenges for CAD Tools Design
Authors: Luiza Gheorghe, Gabriela Nicolescu
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper surveys the multi-technology Multi-processors Systems-on-Chip (MP SoC) - we emphasize the systems including optical solution for on-chip interconnects as an alternate solution for the current challenges in MP SoCs such as networks bandwidth, scalability and flexibility. We present also some tools and methodologies for global specification of multi-technology systems and the challenges for CAD tools design.
Numerical simulation of mixed convection over a three-dimensional horizontal backward-facing step
Authors: Juan Gabriel Barbosa Saldana
Venue:  (2005)

A FORTRAN code was developed to numerically simulate the mixed convective flow over a three-dimensional horizontal backward-facing step. The momentum and energy equations under the assumption of the Boussinesq approximation were discretized by means of a finite volume technique. The SIMPLE algorithm scheme was applied to link the pressure and velocity fields inside the domain while an OpenMP parallel implementation was proposed to improve the numerical performance and to accelerate the numerical solution. The heating process corresponds to a channel heated from below at constant temperature keeping insulated all the other channel walls. In addition, the back-step was considered as a thermally conducting block and its influence in the heating process was explored by holding different solid to fluid thermal conductivity ratios. The effects over the velocity and temperature distribution of buoyancy forces, acting perpendicular to the mainstream flow, are studied for three different Richardson numbers Ri = 3, 2, and 1 and the results are compared against those of pure forced convection Ri = 0. In these simulations the Reynolds number is fixed at 200 while the bottom wall temperature is adjusted to fulfill the conditions for the different Ri. Under this assumption, as Ri increases the buoyancy effects are the dominant effects in the mixed convective process. The numerical results indicate that the velocity field and the temperature distribution for pure forced convection are highly distorted if compared with the mixed convective flow. If the Ri parameter is increased, then the primary re-circulation zone is reduced. Similarly, as the buoyancy forces become predominant in the flow, the convective rolls, in the form of spiral-flow structures, become curlier and then higher velocity components are found inside the domain. The temperature field distribution showed that as the Ri is increased a thicker layer of high temperature flow is located at the channel's top wall as a result of the higher rates of low-density flow moving to the top wall. The flow is ascending by the channel sidewalls, while descending by the channel span-wise central plane. The parallel numerical strategy is presented and some results for the performance of the OpenMP implementation are included. In this sense, linear speedup was obtained when using 16 possessors in parallel.
A Hybrid Algorithm to Reconfigure Platforms of Radio Mobile Services
Authors: Asma Ben Letaifa, Sami Tabbane, Zied Choukai
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Radio mobile multimedia services are much more requested these years and operators must answer to the requirements while guaranteeing quality of service. Among the solutions, mobile network platforms must be able to answer efficiently and on time to the expectations of the users through dynamic adaptation of the architecture. Our model is based on a hybrid algorithm to reconfigure the platform dynamically. It is inspired from methods from graph theory, operational research, network optimization and load balancing work. We present in this paper some results in case of servers or links congestion obtained from the simulation platform.