ppxscal/embedding_network huggingface dataset:
The boxer: round 1
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

In a dark room, a pair of boxing dolls stare at each other silently. Even with the smallest move they cannot help hitting each other. A funny boxing game featuring Vicky and Johnny, a tomboy and a poor fella who can never win. Copyright held by creator.
A new memory concept: the nano-multiple-tunnel-junction memory with embedded Si nano-crystals
Authors: D. Deleruyelle, C. Le Royer, B. DeSalvo, G. Le Carval, M. Gely, T. Baron, J. L. Autran, S. Deleonibus
Venue: Microelectronic Engineering (2004)

This work reports the fabrication and the electrical characterization of a new multiple-tunnel-junction memory (named nano-MTJ) employing silicon nano-crystals embedded in ultra-thin tunnel oxides to control the charging/ discharging phenomena of the floating gate. Electrical results here presented correspond to cells with active areas as small as W × L = 40 nm × 30 nm and show that the integration of nano-meter sized Si-dots instead of silicon oxide provides comparable writing characterisitics and improved data-retention. A theoretical approach is also proposed, based on the Orthodox theory. Our model quantitatively establishes the improvement of both writing and chargeloss characterisitics for the nano-MTJ devices due to Coulomb blockade and quantum confinement in silicon nano-crystals.
Multilevel hierarchical matrix multiplication on clusters
Authors: Sascha Hunold, Thomas Rauber, Gudula Rünger
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

Matrix-matrix multiplication is one of the core computations in many algorithms from scientific computing or numerical analysis and many efficient realizations have been invented over the years, including many parallel ones. The current trend to use clusters of PCs or SMPs for scientific computing suggests to revisit matrix-matrix multiplication and investigate efficiency and scalability of different versions on clusters. In this paper we present parallel algorithms for matrix-matrix multiplication which are built up from several algorithms in a multilevel structure. Each level is associated with a hierarchical partition of the set of available processors into disjoint subsets so that deeper levels of the algorithm employ smaller groups of processors in parallel. We perform runtime experiments on several parallel platforms and show that multilevel algorithms can lead to significant performance gains compared with state-of-the-art methods.
System sketching: the generation of rapid prototypes for transaction based systems
Authors: Gerard C. McCoyd, John R. Mitchell
Venue: Proceedings of the workshop on Rapid prototyping (1982)

Rapid prototypes are important tools to aid users in formulating their software requirements. The system sketch is a rapid prototype which shows the user the functions of the system he has specified.In this paper we present a system sketch produced by a processor written in LISP which interprets software requirements stated in an expanded PSL-like requirements language. Discussions of the language and the processor are presented.
Support System of Advertising Distribution Contract for Media-Mix Strategy
Authors: Shinya Takami, Atsushi Yamada, Hiroshi Hoshino, Takashi Oseto
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

In the advanced information society, various interactive media will be used. Media-Mix strategy would draw attention as a more important marketing approach for advertising industry. We need a new market model to use and combine those media effectively for the strategy. In this research, we propose an advertising contents contract and market model by the electronic contract. The support system of advertising distribution contract, which supports media planning and distribution contract, is the central existence. The system can draw up a media plan in real time that effectively combines various advertising frames suitable for the Media-Mix strategy by evaluating the advertising effectiveness. Moreover, when the system helps advertisers with a series of work from media planning to distribution contract, inexpensive advertising frames can be used effectively.
Prototyping and small scale software projects
Authors: Eugene M. Strand, Warren T. Jones
Venue: Proceedings of the workshop on Rapid prototyping (1982)

To reduce the development time of small scale interactive software systems for research and clinical use in cardiology at UAB a display-oriented language was developed. Experience with this system has been very successful in early stabilization of the specification of the user dialogue.
Scheduling with conflicts on bipartite and interval graphs
Authors: Sandy Irani, Vitus Leung
Venue: Journal of Scheduling (2003)

In this paper, we consider the on-line scheduling of jobs that may be competing for mutually exclusive resources. We model the conflicts between jobs with a conflict graph, so that the set of all concurrently running jobs must form an independent set in the graph. This model is natural and general enough to have applications in a variety of settings; however, we are motivated by the following two specific applications: traffic intersection control and session scheduling in high speed local area networks with spatial reuse. Our results focus on two special classes of graphs motivated by our applications: bipartite graphs and interval graphs. The cost function we use is maximum response time. In all of the upper bounds, we devise algorithms which maintain a set of invariants which bound the accumulation of jobs on cliques (in the case of bipartite graphs, edges) in the graph. The lower bounds show that the invariants maintained by the algorithms are tight to within a constant factor. For a specific graph which arises in the traffic intersection control problem, we show a simple algorithm which achieves the optimal competitive ratio.
Quantitative Characterization of Event Streams in Analysis of Hard Real-Time Applications
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Many real-time embedded systems process event streamswhich are composed of a finite number of different eventtypes. Each different event type on the stream would typicallyimpose a different workload to the system, and thusthe knowledge of possible correlations and dependenciesbetween the different event types could be exploited to gettighter analytic performance estimations of the completesystem. We propose an abstract stream model to characterizesuch an event stream. The model captures the needed informationof all possible traces of a class of event streamsand can hence be used to obtain hard bounded worst-caseand best-case estimations of a system. We show how theproposed abstract stream model can be obtained from aconcrete stream specification, and how it can be used forperformance analysis. The applicability of our approachand its advantages over traditional worst-case performanceanalysis are shown in a case study of a multimedia application.
Supporting Protocol-Based Care in Medicine via Multiple Coordinated Views
Authors: Wolfgang Aigner, Silvia Miksch
Venue: Proceedings of the Second International Conference on Coordinated & Multiple Views in Exploratory Visualization (2004)

Computer supported protocol-based care aims to aid physicians in the treatment process. The main focus of current research is directed towards the formal methods and representations used "behind the scenes" of such systems. This work on the contrary, is situated at the human end of the human-machine chain. We describe the development of interactive visualization methods to support protocol-based care. We provide multiple simultaneous views to cover different aspects of a complex underlying data structure of treatment plans and patient data. The tightly coupled views use visualization methods well-known to domain experts and are designed to facilitate usersý tasks. The views are based on the concepts of clinical algorithm maps and LifeLines which have been extended in order to cope with the powerful and expressive plan representation language Asbru. The user-centered development approach applied for these interactive visualization methods has been guided by user input gathered via a user study, design reviews, and prototype evaluations.
Data densification in a relational database system
Authors: Abhinav Gupta, Sankar Subramanian, Srikanth Bellamkonda, Tolga Bozkaya, Nathan Folkert, Lei Sheng, Andrew Witkowski
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Data in a relational data warehouse is usually sparse. That is, if no value exists for a given combination of dimension values, no row exists in the fact table. Densities of 0.1-2% are very common. However, users may want to view the data in a dense form, with rows for all combination of dimension values displayed even when no fact data exists for them. For example, if a product did not sell during a particular time period, users may still want to see the product for that time period with zero sales value next to it. Moreover, analytic window functions [1] and the SQL model clause [2] can more easily express time series calculations if data is dense along the time dimension because dense data will fill a consistent number of rows for each period.Data densification is the process of converting spare data into dense form. The current SQL technique for densification (using the combination of DISTINCT, CROSS JOIN and OUTER JOIN operations) is extremely unintuitive, difficult to express and inefficient to compute. Hence, we propose an extension to the ANSI SQL join operator, referred to as "PARTITIONED OUTER JOIN", which allows for a succinct expression of densification along the dimensions of interest. We also present various algorithms to evaluate the new join operator efficiently and compare it with existing methods of doing the equivalent operation. We also define a new window function "LAST_VALUE (IGNORE NULLS)" which is very useful with partitioned outer join.
Inference of Gene Regulatory Network Based on Module Network Model with Gene Functional Classifications
Authors: Kohei Taki, Reiji Teramoto, Yoichi Takenaka, Hideo Matsuda
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

We propose a novel method for an exhaustive inference of gene regulatory networks from genome-wide expression data and biological knowledge. Our method performs the inferences based on module network model. In the model a module is a set of genes with similar features, and a network represents regulatory relationships among the modules. Our method makes modules using gene functional classification together with expression data. We apply our method to inferences of the networks of yeast cell-cycle. Modules inferred by our method show consistency with experimentally-determined results on yeast cell-cycle, especially on G1 phase. Robust modules built by our method permit us to infer informative regulatory relationships.
Automobile body reinforcement by finite element optimization
Authors: Liangsheng Wang, Prodyot K. Basu, Juan Pablo Leiva
Venue: Finite Elements in Analysis and Design (2004)

This paper is concerned with design optimization of material reinforcement of automobile body for rigidity improvement. Two finite element optimization techniques, topology optimization and sizing optimization, are explored to find out an optimal manufacturing feasible design from multiple optimized designs. The application of these methods demonstrates that through innovative utilization of the topology optimization technique, an optimal manufacturing feasible design can be obtained. The relationship between the rigidity improvement and different configuration of material reinforcement is also investigated. It is concluded that through appropriate application of finite element optimization methods, the overall rigidity of the automobile body can be improved substantially in a cost effective manner.
A Simple Micro-Threaded Data-Driven Processor
Authors: A. Bindal, S. Brugada, T. Ha, W. Sana, M. Singh, V. Tejaswi, D. Wyland
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

The architecture of a simple and networkable data-driven processor is demonstrated. The processor uses computational data-flow graphs as its programming model, in which functional processing nodes exhibit data dependencies among each other to execute instructions. The nature of the programexecution method differs from a conventional processor, which uses a program counter to sequence instructions. The processor is also micro- threaded, in which a single processor can support many nodes, and selects the node to be processed on a cycle-by-cycle basis depending on the availability of data for the node. This data-driven processor consists of a dual-port memory that stores instructions and data, an ALU, and a controller. The flexible architecture allows processors to be grouped in the form of clusters dedicated for certain mathematical functions. Furthermore, clusters can be networked with other clusters for multi-tasking operations. All processors are identical in architecture except for their ALU, which is "tuned" for better performance at different tasks during a networked operation.
XML Access Control and e-Commerce Technologies for Advanced Information Distribution
Authors: Mizuho Iwaihara, Somchai Chatvichienchai, Takayuki Shiga, Yahiko Kambayashi
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

In this paper, we summarize our research .. results on nextgeneration information distribution, which can serve as keytechnologies for e-government and e-commerce. Two topicsare covered. One is translating XML access authorizations,which is a vital technology for exchanging XML documentsbetween various organizations while preserving requiredaccess security. The other is generating web menus forconfigurable goods. This topic covers an important issue ine-commerce, discussing the problem of generatingappropriate web menu structures for configurable goods, bywhich buyers can easily configure components of their needs,with less chance of facing combination errors.
Consistent Normal Orientation for Polygonal Meshes
Authors: Pavel Borodin, Gabriel Zachmann, Reinhard Klein
Venue: Proceedings of the Computer Graphics International (2004)

In this paper, we propose a new method that can consistentlyorient all normals of any mesh (if at all possible),while ensuring that most polygons are seen with theirfront-faces from most viewpoints. Our algorithm combinesthe proximity-based with a new visibility-based approach.Thus, it virtually eliminates the problems of proximity-basedapproaches, while avoiding the limitations of previoussolid-based approaches.Our new method builds a connectivity graph of thepatches of the model, which encodes the "proximity" ofneighboring patches. In addition, it augments this graphwith two visibility coefficients for each patch. Based onthis graph, a global consistent orientation of all patches isquickly found by a greedy optimization.We have tested our new method with a large suite of models,many of which from the automotive industry. The resultsshow that almost all models can be oriented consistentlyand sensibly using our new algorithm.
Rapid prototyping, automatic programming, and experimental sciences
Authors: David Barstow
Venue: Proceedings of the workshop on Rapid prototyping (1982)

Automatic programming as a strategy for developing rapid prototyping systems is an attractive alternative (although perhaps further in the future) to human-oriented methodologies and to executable specifications. In the case of some experimental sciences, however, it is currently possible to develop rapid prototyping systems using the automatic programming strategy. The greatest value of such systems is gained when they are oriented toward use by domain scientists, rather than software engineers. This goal has major implications for the specification language, the user interface, and the programming knowledge required by the system.
The optical tweezers: multiple-point interaction technique
Authors: Sergey V. Matveyev, Martin Göbel
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

The proposed multiple-point interaction technique realizes direct interaction and control in a virtual environment and presentation. The device for interaction is constructed on the basis of the infrared (IR) laser which is invisible for a human eye and does not interfere with the visual channel of a presentation, since there can be no coincidence of the color of the infrared laser and the visible object on the screen.The special designed optical scheme splits a laser beam into three with a small angle of divergence. As a result we receive the three IR spots on the screen.The coordinates of the laser spots received from the infrared camera are interpreted as a position of the (pointer) cursor after the mathematical processing which is displayed with the help of the projection system and can be interpreted as commands of the application control.
An automatic weighting scheme for collaborative filtering
Authors: Rong Jin, Joyce Y. Chai, Luo Si
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Collaborative filtering identifies information interest of a particular user based on the information provided by other similar users. The memory-based approaches for collaborative filtering (e.g., Pearson correlation coefficient approach) identify the similarity between two users by comparing their ratings on a set of items. In these approaches, different items are weighted either equally or by some predefined functions. The impact of rating discrepancies among different users has not been taken into consideration. For example, an item that is highly favored by most users should have a smaller impact on the user-similarity than an item for which different types of users tend to give different ratings. Even though simple weighting methods such as variance weighting try to address this problem, empirical studies have shown that they are ineffective in improving the performance of collaborative filtering. In this paper, we present an optimization algorithm to automatically compute the weights for different items based on their ratings from training users. More specifically, the new weighting scheme will create a clustered distribution for user vectors in the item space by bringing users of similar interests closer and separating users of different interests more distant. Empirical studies over two datasets have shown that our new weighting scheme substantially improves the performance of the Pearson correlation coefficient method for collaborative filtering.
Grid PSE Builder: A Framework for Building Web-based Distributed PSE on Grid
Authors: Motonori Hirano, Naotaka Yamamoto, Hiroshi Takemiya, Yoshio Tanaka, Satoshi Itoh, Satoshi Sekiguchi
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

In order to provide a framework for building web-based distributed PSEs on a grid, we have been designing and implementing Grid PSE Builder. By using Grid PSE Builder, PSE providers can easily build a PSE using existing large scale scientific-engineering application as PSE components, without specialized knowledge about web security and programming. On the other hand, PSE user can access the PSE with highly secured way only by using a web interface. We have built some web application portals with existing applications by using Grid PSE Builder as a web portal toolkit and it is possible to make existing applications into PSE components with only a small amount of works.
Makespan minimization subject to flowtime optimality on identical parallel machines
Authors: Chien-Hung Lin, Ching-Jong Liao
Venue: Computers and Operations Research (2004)

We consider the identical parallel machine problem with makespan minimization subject to minimum total flowtime. First, we develop an optimal algorithm to the identical parallel machine problem with the objective of minimizing makespan. To improve the computational efficiency, two implementation techniques, the lower bound calculation and the job replacement rule, are applied. Based on the algorithm, an optimal algorithm, using new lower bounds, to the considered problem is developed. The result of this study can also be used to solve the bicriteria problem of minimizing the weighted sum of makespan and mean flowtime. Computational experiments are conducted up to six machines and 1000 jobs. Although the proposed algorithm has an exponential time complexity, the computational results show that it is efficient to find the optimal solution.
StreaMon: an adaptive engine for stream query processing
Authors: Shivnath Babu, Jennifer Widom
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

StreaMon is the adaptive query processing engine of the STREAM prototype Data Stream Management System (DSMS) [4]. A fundamental challenge in many DSMS applications (e.g., network monitoring, financial monitoring over stock tickers, sensor processing) is that conditions may vary significantly over time. Since queries in these systems are usually long-running, or continuous [4], it is important to consider adaptive approaches to query processing. Without adaptivity, performance may drop drastically as stream data and arrival characteristics, query loads, and system conditions change over time.StreaMon uses several techniques to support adaptive query processing [1, 2, 3]; we demonstrate three of them:&bull;Reducing run-time memory requirements for continuous queries by exploiting stream data and arrival patterns.&bull;Adaptive join ordering for pipelined multiway stream joins, with strong quality guarantees.&bull;Placing subresult caches adaptively in pipelined multiway stream joins to avoid recomputation of intermediate results.
Expander flows, geometric embeddings and graph partitioning
Authors: Sanjeev Arora, Satish Rao, Umesh Vazirani
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We give a O(√log n)-approximation algorithm for sparsest cut, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leighton and Rao (1988). We use a well-known semidefinite relaxation with triangle inequality constraints. Central to our analysis is a geometric theorem about projections of point sets in Rd, whose proof makes essential use of a phenomenon called measure concentration. We also describe an interesting and natural "certificate" for a graph's expansion, by embedding an n-node expander in it with appropriate dilation and congestion. We call this an expander flow.
Research proposal to study: the role of executable metric models in the programming process
Authors: M. M. Lehman
Venue: Proceedings of the workshop on Rapid prototyping (1982)

A brief summary of current thinking about the programming process and programming support environments is followed by the presentation of an laternative viewpoint based on the concept of models. Examples of executable metric models and of the role they might play suggest research to examine and evaluate their use, to develop appropriate methodologies and tool support and to study techniques for their integration into an advanced environment. Successful completion of such investigations will provide one of the basic technologies needed for the successful design and construction of a vertically integrated programming support system.