ppxscal/embedding_network huggingface dataset:
Combining full text and bibliometric information in mapping scientific disciplines
Authors: Patrick Glenisson, Wolfgang Glänzel, Frizo Janssens, Bart De Moor
Venue: Information Processing and Management: an International Journal (2005)

In the present study results of an earlier pilot study by Glenisson, Glänzel and Persson are extended on the basis of larger sets of papers. Full text analysis and traditional bibliometric methods are serially combined to improve the efficiency of the two individual methods. The text mining methodology already introduced in the pilot study is applied to the complete publication year 2003 of the journal Scientometrics. Altogether 85 documents that can be considered research articles or notes have been selected for this exercise. The outcomes confirm the main results of the pilot study, namely, that such hybrid methodology can be applied to both research evaluation and information retrieval. Nevertheless, Scientometrics documents published in 2003 cover a much broader and more heterogeneous spectrum of bibliometrics and related research than those analysed in the pilot study. A modified subject classification based on the scheme used in an earlier study by Schoepflin and Glänzel has been applied for validation purposes.
Improved Flash Memory Grows in Popularity
Authors: George Lawton
Venue: Computer (2006)

As its performance, price, and popularity improve, some industry observers are predicting robust growth for the NAND flash market.
A Unified Authorization Platform Based on RBAC4WAS Model for Web Application System Integration
Authors: Zhu Qiaoming, Li Peifeng, Zhang Su, Qian Peide
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

The article puts forward an extended model of role-based access control for web application system (WAS). This model is named as RBAC4WAS, which comes of RABC model and gives the extended formal description. It is a universal model which is able to apply for the web application integration area to fit for most of the web application system in authorization management. The article also expounds the design scheme for Web application integration unified authorization platform (UAP) based on RABC4WAS model. And it describes how to use the UAP to integrate the web application system to realize a single sign-on portal.
Systematic development of process-control systems for ultra-high dependability assurance based on independently developable end-user assessable logical aspects
Authors: Dongfeng Wang
Venue:  (2005)

Process-control systems are usually very complicated and safety-critical. For the development of these systems, it is necessary to be able not only to achieve high quality but also to rigorously demonstrate that high quality has in fact been achieved, i.e., to make them highly dependable. However, since process-control systems are usually very complex and have very huge state spaces, it is too difficult and costly to exhaustively test the state space of these systems to achieve high assurance. Considering this problem, we propose a novel model in which a system is composed from several aspects through pre-defined composition patterns. Each aspect can be not only designed and implemented independently of the other aspects in the system, but can also be tested or verified at the end-user level independently of all the other aspects. We refer to these aspects as Independently Developable End-user Assessable Logical (IDEAL) aspects. The composition pattern consists of three categories, namely, composers, coordinators, and fairness handlers. These composition patterns are pre-defined and can be hardware supported. The system properties (reliability, safety, and stability) can be mathematically inferred from the properties of the individual IDEAL aspects so that conventional integration testing and verification of the entire system is not needed. Based on this model, we present a systematic development technique, i.e., the IDEAL aspects of a process-control system and their composition patterns can be automatically synthesized through the specification of the system guided by several principles developed by us. These principles are evolved to automated tool support. This systematic development method is applied to several examples and a case study involving the control of a future version of the Bay Area Rapid Transit (BART) system.
The Recognition Strategy Language
Authors: Richard Zanibbi, Dorothea Blostein, James R. Cordy
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

The table recognition literature contains many strategies specified informally as a sequence of operations, obscuring both models of table structure and the effects of individual decisions. Decision making is more transparent in formal model-based approaches (e.g. grammar-based) but these approaches are less flexible than informal ones. We propose an intermediate level of formalization, defining strategies as a sequence of basic graph transformations that correspond to recognition operations (e.g. classification, segmentation). Transformations are parameterized by logical types and decision functions, which together define structure models and executable strategies for interpreting input graphs. We provide an overview of our first attempt at this intermediate level of formalization, the Recognition Strategy Language (RSL). As a proof-of-concept, we reimplement two informally specified table recognition strategies from the literature in RSL. The RSL implementations capture descriptions of the formerly implicit table structure models, and automatically capture all decision making.
A ship off-loading problem
Authors: Toby J. Teorey
Venue: ACM SIGSIM Simulation Digest (1974)

Sea Port operations consist of the off-loading of ships and transfer of cargo away from the pier so that other ships may be efficiently processed. The major system components of such an operation are the ship, the pier area, intransit storage approximately 2 miles from the pier area, and an inland storage depot at a distance of 56 miles from the sea port. Transportation for the cargo is provided by 2 hooks on board ship, 4 forklifts (12,000 lb.) at the pier, 10 5-ton trucks and 2 additional forklifts available at both the intransit storage area and the inland depot. The cargo on board ship is of three categories: containerized in 20' x 8' x 8' boxes, palletized on 7' x 8' pallets, and bulk cargo.
Development of User-friendly Supercomputing Portal in Bio Research Field
Authors: Hiroaki Yuasa, Takeshi Iwasaki, Motoyoshi Kurokawa, Takayuki Shigetani, Tsuyoshi Horiki, Ryutaro Himeno
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

The RIKEN Super Combined Cluster (RSCC) System in RIKEN Wako Inst., started its operation in March, 2004. A web portal system called Bio Portal was developed to utilize a Linux cluster (a part of RSCC) for data analysis in the life sciences. A small SMP server was then placed in RIKEN Yokohama Inst. for small analysis, and the Bio Portal integrates both RSCC and this SMP server through the application of Grid technology. The aim of this portal system was to construct a simple data analysis environment for experimental researchers, and to improve performance of data analysis through the use of two differently performing computing resources. In this paper, we describe the web interface and functions of Bio Portal in detail. Later we explain RSCC, and discuss performance evaluations of the distribution patterns for BLAST jobs. Finally, we propose bioinformatics job distribution patterns for high throughput processing.
Synthesizing transition textures on succession patterns
Authors: Yueh-Yi Lai, Wen-Kai Tai, Chin-Chen Chang, Chen-Duo Liu
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Synthesizing transition textures on succession patterns for displaying visually acceptable terrain is essential to applications such as computer games. In this paper, we exploited the Game of Life model to simulate successions on terrain to show that a good-looking profile can appear quickly and easily. Based on the proposed modified patch-based sampling texture synthesis approach, the basic types of transition textures on a succession pattern can be well synthesized. This method first generates a well-shaped transition cut along the source texture. Next, the feature maps of the source texture and the target texture are used to determine complementary patches from the target texture that will fit well along the source's transition cut. As the experimental results show, only a few input textures are required by our approach to synthesize plenty of tileable transition textures which are useful for obtaining vivid terrain while consuming only a small amount of texture memory.
The effect of latency and network limitations on MMORPGs: a field study of everquest2
Authors: Tobias Fritsch, Hartmut Ritter, Jochen Schiller
Venue: Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games (2005)

Networked games are becoming more and more important in the last years. One of the current game evolutions is creating massive virtual environments, so called MMORPGs (massive multiplayer online role-playing games). Those game types exist for more than 10 years, but the market and the number of products grew incredibly strong in the last two years.With such an evolution comes the need for new techniques to cope with special problem fields such as effects of latency with 200 and more players. Thus understanding and pointing out the new problem fields will help to design fitting solutions for expansions like a mobile MMORPG version.This paper will give a brief introduction into the MMORPG history. Furthermore it will evaluate certain latency problems in a field study of Everquest2, referring to the previous work at "Overviewing Scientific Research for (Mobile) Gaming" and point out possibilities to design MMO(RP)Gs in a mobile content.
Automating the performance management of component-based enterprise systems through the use of redundancy
Authors: Ada Diaconescu, John Murphy
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Component technologies are increasingly being used for building enterprise systems, as they can address complex functionality and flexibility problems and reduce development and maintenance costs. Nonetheless, current component technologies provide little support for predicting and controlling the emerging performance of software systems that are assembled from distinct components.This paper presents a framework for automating the performance management of complex, component-based systems. The adopted approach is based on the alternate usage of multiple component variants with equivalent functional characteristics, each one optimized for a different running environment. A fully-automated framework prototype for J2EE is presented, along with results from managing a sample enterprise application on JBoss. A mechanism that uses monitoring data to learn and automatically improve the framework's management behaviour is proposed. The framework imposes no extra requirements on component providers, or on the component technologies.
Dot Plots for Time Series Analysis
Authors: Dragomir Yankov, Eamonn Keogh, Stefano Lonardi, Ada Waichee Fu
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Since their introduction in the seventies by Gibbs and McIntyre, dot plots have proved to be a powerful and intuitive technique for visual sequence analysis and mining. Their main domain of application is the field of bioinformatics where they are frequently used by researchers in order to elucidate genomic sequence similarities and alignment. However, this useful technique has remained comparatively constrained to domains where the data has an inherent discrete structure (i.e., text). In this paper we demonstrate how dot plots can be used for the analysis and mining of real-valued time series. We design a tool that creates highly descriptive dot plots which allow one to easily detect similarities, anomalies, reverse similarities, and periodicities as well as changes in the frequencies of repetitions. As the underlying algorithm scales well with the input size, we also show the feasibility of the plots for on-line data monitoring.
Results on Range Image Segmentation for Service Robots
Authors: Stefan Gachter, Viet Nguyen, Roland Siegwart
Venue: Proceedings of the Fourth IEEE International Conference on Computer Vision Systems (2006)

This paper presents an experimental evaluation of a plane extraction method using various line extraction algorithms. Four different algorithms are chosen, which are well known in mobile robotics and computer vision. Experiments are performed on two sets of 25 range images either obtained by simulation or acquired by a proprietary 3D laser scanner. The performance of the range image segmentation is measured in terms of an average segment classification ratio. Moreover, the speed of the method is measured to conclude on the suitability for service robot applications.
An interactive debugging facility for GPSS
Authors: James O. Henriksen
Venue: ACM SIGSIM Simulation Digest (1978)

This paper describes the interactive debugging feature of GPSS/H (1), a new implementation of GPSS for IBM 360/370 computers. In GPSS/H, interactive debugging of a simulation model is carried out by means of a simple, but powerful command language. Commands are provided to selectively display model data on a terminal, to set breakpoints at arbitrary points in a model, and to step through a model one or more blocks at a time. An overview of the command language and an illustrative example of its use are presented in this paper.
Defect-Oriented Test- and Layout-Generation for Standard-Cell ASIC Designs
Authors: Joachim Sudbrock, Jaan Raik, Raimund Ubar, Wiezlaw Kuzmicz, Witold Pleskacz
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

This work shows a new concept to extend the hierar- chical approach of standard-cell circuit design into the area of defect-oriented test pattern generation. For this purpose test patterns to detect shorts for each standard- cell are created separately. A new defect-oriented test generator (DOT) is using these single cell test pattern lists to create testpatterns for the complete circuit. Additionally, test patterns for the routing network will be created.This work targets mainly shorts, but also other defects can be treated in a similar way. In order to generate tests only for relevant combinations of shorted nodes, the critical area for both the cells and the routing network is determined separately and the probability for each short is computed.Shorts inside the routing network can show sequential behaviour. The proposed test pattern generator is also able to find tests for such kind ofdefects. As the eflort to test sequential defects can varyji-om short to short, a new testability analysis is presented. Based on this analysis a redesign of the circuit layout is proposed. This "layout for testability" approach is therefore a defect oriented equivalent for "design for testability" methods.
Specifying and verifying multiagent systems using the cognitive agents specification language (casl)
Authors: Steven Shapiro
Venue:  (2005)

In this thesis, we introduce a specification language (CASL) and verification environment (CASLve) for multiagent systems. We use the situation calculus [52] with Reiter's solution to the frame problem [62]&mdash;enhanced with predicates to describe agents' knowledge [64], beliefs, and goals&mdash;to formally, perspicuously, and systematically describe the effects of actions on the world and the mental states of agents. We add INFORM, REQUEST, and CANCELREQUEST actions to model inter-agent communication, and investigate properties of multiagent knowledge change and goal change, as well as belief change. We use the notation of the concurrent, logic programming language ConGolog [17] to specify the behaviour of agents. ConGolog has a formal semantics defined in the situation calculus, which facilitates the process of reasoning about the behaviour of individual agents and the system as a whole. We provide an environment for verifying properties of CASL specifications, by encoding the situation calculus, its extensions to handle mental states, and ConGolog in the PVS verification system [54], and proving lemmas which are useful for verifying CASL specifications. These include proving that bounded-loop ConGolog programs terminate, and providing a framework far compositional verification of ConGolog programs. We then specify three multiagent systems using CASL and prove some properties of the specifications.
Numerical Convergence of a Parameterisation Method for the Solution of a Highly Anisotropic Two-Dimensional Elliptic Problem
Authors: Philippe Guillaume, Vladimir Latocha
Venue: Journal of Scientific Computing (2005)

Highly anisotropic two-dimensional elliptic problems lead to severe numerical difficulties. In this paper, starting from a simple finite volume scheme, we present a parameterisation method that allows us to obtain the solution even if the anisotropy ratio is very large. We derive a formal asymptotic limit of the two-dimensional anisotropic problem, in the case where the anisotropy ratio goes to infinity. This formal limit is used as a reference, and we show that the parameterisation method gives similar results, whereas the finite volume scheme fails to give an accurate solution. Numerical results are given, which indicate important parameters to be considered in order to obtain a good precision
On the Summability of Formal Solutions of Linear Partial Differential Equations
Authors: Stéphane Malek
Venue: Journal of Dynamical and Control Systems (2005)

We investigate the existence and the Borel summability of formal power series in one variable with holomorphic coefficients, solutions of linear partial differential equations which are not of Kowalewski type in the complex domain. Sufficient conditions are given in terms of the shape of the partial differential equations and initial conditions. Existence and asymptotic behavior of local sectorial holomorphic solutions of these linear partial differential equations are obtained as a by-product.
Content-Based Image Retrieval through a Multi-Agent Meta-Learning Framework
Authors: Abraham Bagherjeiran, Ricardo Vilalta, Christoph F. Eick
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

The objective of a general-purpose content-based image retrieval system is to find images in a database that match an external measure of relevance. Since users follow different and inconsistent relevance measures, processing queries in a task-specific manner has shown to be an effective approach. Viewing specialized image retrieval algorithms as agents, we propose a general-purpose image retrieval system that uses a new multi-agent meta-learning framework. The framework adapts a distance function defined over both image distance weights and image queries to identify clusters of algorithms that produce similar solutions to similar problems. Experiments compare our approach with a traditional information retrieval algorithm; results show that our framework provides better average relevance scores.
Rendering translucency with Perlin noise
Authors: Ryan Barnard, Saim Ural
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Translucent photon mapping is a technique developed for the realistic rendering of translucent materials such as milk, skin, and fog. In the physical world, however, no material is perfectly translucent at a constant density. By using a 3D density map for a rendered object and jittering the values of the map by using a Perlin noise function will create a non-perfect density throughout the object and thereby present a more realistic image.
Efficient paging and multicast schemes for Mobile Virtual Private Networks: Research Articles
Authors: Zohar Naor
Venue: Wireless Communications Mobile Computing (2005)

The issue of providing a mobile virtual private network (MVPN) service by a cellular network is addressed in this study. The main focus of this study is on two aspects of MVPN handling: a multicast transmission, and location management of the MVPN members. Virtual private networks (VPNs) already exist in wired networks. The growing number of mobile users increases the demand for mobile services. It is expected that future wireless networks will have to provide wireless internet services, and in particular, to support MVPNs. In order to maintain an MVPN service offering, the system must support an efficient information delivery to the MVPN members. In order to achieve this goal, the physical locations of the MVPN members must be known to the system. In this study, we present methods to efficiently route and transmit information to the MVPN members, without affecting the quality of the personal service provided to each and every MVPN member. It is shown that the wireless MVPN bandwidth requirement is significantly less than the equivalent bandwidth required by a wired VPN. The offered bandwidth utilization is significantly better than the efficiency of IP-based multicast transmission in the Internet, and the proposed IP-based multicast transmission in cellular networks. Copyright &copy; 2005 John Wiley & Sons, Ltd.
The Localization and Correction of Errors in Models: A Constraint-Based Approach
Authors: Sylvain Piechowiak, Joaquin Rodriguez
Venue: Applied Intelligence (2005)

Model-based diagnosis, and constraint-based reasoning are well known generic paradigms for which the most difficult task lies in the construction of the models used. We consider the problem of localizing and correcting the errors in a model. We present a method to debug a model. To help the debugging task, we propose to use the model-base diagnosis solver. This method has been used in a real application of the development a model of a railway signalling system.
Document Retrieval Using Projection by Frequency Distribution
Authors: Hirohito Oh'uch, Takao Miura, Isamu Shioya
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

In document retrieval task, random projection (RP) is considered as a useful technique of dimension reduction. The task can be achieved very quickly yet the recalculation is not necessarry to any changes. However, in lower dimension, random projection has instability by randomness in itself. In this investigation, we propose a new technique, called skewed projection (SP) for dimension reduction technique based term frequency distribution. We show that this technique can take advantages of local independency thus we can obtain efficient retrieval for documents which belong to specific application area.