ppxscal/embedding_network huggingface dataset:
Web Marine Spatial Information Service Based on Electronic Nautical Charts
Authors: Feixiang Zhu, Yingjun Zhang, Wenhai Sang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Aiming at the urgent problem existed in today's constructions of marine information system that the marine spatial data cannot be sweepingly accessed and shared by ordinary people, this paper proposes a Web System for Marine Spatial Information Service based on Electronic Nautical Charts. However, the Electronic Nautical Charts System has its own complicated nautical symbol that is different from the common GIS platform. So the web service of Electronic Nautical Chart (ENC) data conformed to Vector Chart Format (VCF) is not completely supported by ArcIMS which is a Web-GIS platform for land-use produced by USA Environmental System Research Institute (ESRI) Company. This paper presents a novel method that ArcIMS's symbol libraries extension is used to fulfill the specialized chart visualization by using the COM-based GIS component MapObjects. This system accepts ENC data coded in Chinese VCF, and develops COM-based nautical symbol library software for nautical chart mapping, and then adopts MapObjects to extend ArcIMSs symbol libraries, and last distributes ENC service by ArcIMS and ArcSDE. Unlike previous works, the method presented by this paper decreases the difficulty of software development and shortens the period of software development. Furthermore, the COM-based framework makes it convenient to extend system function flexible by developing new specific models as a component. To validate the feasibility of proposed system, authors implement a prototype system.
Microsystems Modular Programming in PL/M
Authors: W. Brown
Venue: Computer (1978)

Various methodologies have been used to control the high-and rising-cost of developing software products. Among these, one technique that has proved effective entails constructing programs from small, well-defined modules. This technique, called modular programming, can be used in any programming language; however, without language support to enforce module boundaries, errors often occur.
The Programmer's Apprentice: Knowledge Based Program Editing
Authors: R. C. Waters
Venue: IEEE Transactions on Software Engineering (1982)

An initial implementation of an interactive programming assistant system called the programmer's apprentice (PA) is described. The PA is designed to be midway between an improved programming methodology and an automatic programming system. The intention is that the programmer will do the hard parts of design and implementation while the PA will assist him wherever possible. One of the major underpinnings of the PA is a representation (called a plan) for programs which abstracts away from the inessential features of a program, and represents the basic logical properties of the algorithm explicitly.
Multi-Layer Event Trace Analysis for Parallel I/O Performance Tuning
Authors: Pin Lu, Kai Shen
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

The complexity of parallel I/O systems lies in the deep I/O stack with many software layers and concurrent I/O request handling at multiple layers. This paper explores multi-layer event tracing and analysis to pinpoint the system layers responsible for performance problems. Our approach follows two principles: 1) collect generic (layer-independent) events and I/O characteristics to ease the analysis on cross-layer I/O characteristics evolution; 2) perform bottom-up trace analysis to take advantage of the relatively easy anomaly identification at lower system layers. Our empirical case study discovered root causes for several anomalous performance behaviors of MPI-IO applications running on a parallel file system. First, we detect an anomaly with the asynchronous I/O implementation in the GNU C runtime library. Additionally, we find that concurrent I/O from multiple MPI processes may induce frequent disk seek/rotation and thus degrade the I/O efficiency. We also point out that lack of asynchronous support at the parallel file system client side may result in inefficiency for fine-grained writes. Using an aggressive I/O prefetching strategy and a corrected asynchronous I/O implementation, we achieve 39-156% read I/O throughput improvement for four out of five applications that we experimented.
Guaranteed Response Times in a Hard-Real-Time Environment
Authors: D. W. Leinbaugh
Venue: IEEE Transactions on Software Engineering (1980)

This paper describes a scheduling algorithm for a set of tasks that guarantees the time within which a task, once started, will complete. A task is started upon receipt of an external signal or the completion of other tasks. Each task has a rxed set of requirements in processor time, resources, and device operations needed for completion of its various segments. A worst case analysis of task performance is carried out. An algorithm is developed for determining the response times that can be guaranteed for a set of tasks. Operating system overhead is also accounted for.
B-trees, shadowing, and clones
Authors: Ohad Rodeh
Venue: ACM Transactions on Storage (TOS) (2008)

B-trees are used by many file systems to represent files and directories. They provide guaranteed logarithmic time key-search, insert, and remove. File systems like WAFL and ZFS use shadowing, or copy-on-write, to implement snapshots, crash recovery, write-batching, and RAID. Serious difficulties arise when trying to use b-trees and shadowing in a single system. This article is about a set of b-tree algorithms that respects shadowing, achieves good concurrency, and implements cloning (writeable snapshots). Our cloning algorithm is efficient and allows the creation of a large number of clones. We believe that using our b-trees would allow shadowing file systems to better scale their on-disk data structures.
Modeling Web Service Choreography and Orchestration with Colored Petri Nets
Authors: Xinguo Deng, Ziyu Lin, Weiqing Cheng, Ruliang Xiao, Lina Fang, Ling Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The Web Service Choreography Interface (WSCI) describes the observable behavior of a Web Service and the collective message exchange among interacting Web Services. However, WSCI does not address the definition and the implementation of the internal processes that actually drive the message exchange. In order to describe and compose a global view of the dynamic of the message exchange by understanding the interactions with the web service, this paper presents the process and result of modeling web service choreography and orchestration with colored Petri nets (CPNs) on the basis of analysis, simplicity and composition of WSCI. The colored Petri nets model of a typical use case "Plan and Book Trip" is constructed, whose correctness is validated by the simulation analysis of Message Sequence Chart (MSC).
Research on a Piecewise Linear Chaotic Map and Its Cryptographical Application
Authors: Yun-feng wang, Man-de Xie, Ai-Ming Ji
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

When piecewise linear chaotic map (PLCM) is used in digital cryptosystem, the multiple iterations are required and the encryption speed becomes low. A new kind of PLCM with a segment number parameter (SNP) is presented to solve this problem. The implementation precision, SNP and the number of iteration are analyzed, and then their functional relationship was developed. In the digital cryptosystem using the presented map, the larger the SNP is, the smaller the number of iteration is, and hence the faster the encryption speed is. But the chaotic map and its implementation by hardware become more complex too.
Deployable multipath communication scheme with sufficient performance data distribution method
Authors: Yohei Hasegawa, Ichiro Yamaguchi, Takayuki Hama, Hideyuki Shimonishi, Tutomu Murase
Venue: Computer Communications (2007)

Multi-homed environments are increasingly common, especially for mobile users. And several multipath communication techniques have been proposed, such as multipath TCP communication techniques. Multipath TCP techniques have potential to fully utilize multiple paths, but, these methods have difficulties in implementation and deployment, because users need to modify their applications or operating system or both. In this paper, we propose simple multipath communication technique, which we call Arrival-Time matching Load-Balancing (ATLB). ATLB is designed to be easily implementable on several environments. Besides, we also introduce overlay network approach which implicitly provides parallel data transfer scheme to users. The ATLB continuously calculates transmission delays of each path, including TCP queuing delay at a sender and network delay, and then sends a data segment through the TCP connection with the lowest delay. Simulation results show that ATLB realizes sufficient performance even in heterogeneous environments where the quality of paths differs. Measurement results over our wireless LAN test-bed system suggest that ATLB can fully utilize the aggregate available bandwidth over unstable multiple wireless links.
The Automated Dictionary
Authors: M. S. Fox
Venue: Computer (1980)

The pocket calculator is now an integral part of math education; a portable language-oriented device could have a similar impact on reading and writing instruction.
Pictorial Information Systems
Authors: Shi-Kuo Chang
Venue: Computer (1981)

A pictorial information system is a special type of information system supporting the manipulation, storage, retrieval, and analysis of pictorial data. In the past, pictorial information systems have usually been designed for specific applications. But recent advances in data base technology, computer graphics, and pictorial data structures have led to the development of more general-purpose systems. This special issue is a survey of several design aspects of these systems. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Data Flow Computing Software Development
Authors: J. R. McGraw
Venue: IEEE Transactions on Computers (1980)

Data flow computing is one of the most radical approaches for multiprocessing. A computation is represented by its data flow graph and scheduling of each operator is done at run-time when all of its operands' values are available. This paper addresses the problem of language design for a data flow environment. It briefly surveys several alternatives for a data flow language and then focuses on one specific effort: the Massachusetts Institute of Technology's VAL. This language stresses implicit concurrency. Both programmer and translator can easily identify and exploit concurrency because VAL disallows all forms of side-effects and aliasing. The paper concludes with an analysis of the language and areas of continued research. While substantial progress has been made, much remains to be done in the areas of language design, translation, and use.
Fault-tolerant digital systems implemented with partially definite and partially correct automata
Authors: Nataliya Yakymets, Vyacheslav Kharchenko
Venue: Proceedings of the 2007 workshop on Engineering fault tolerant systems (2007)

The multi-version approach to the system design is becoming a standard for the critical applications as it allows decreasing the probability of common mode failure. The main idea of this approach is to obtain the least correlated versions of the same project. The effective way to satisfy this requirement is to combine classical and non-classical approaches to the system design. In this point, genetic algorithms (GAs) can be successfully used as one of the non-classical approaches in order to evolve the non-conventional digital systems. However, there are two main issues that arise while using GA: in some cases GA is not able to evolve a completely correct solution; if a complexity of system logic grows the time consumptions significantly increase. To avoid both issues, we elaborate the concepts of correctness and definiteness for digital automata, which are the solutions received with GA, and represent the efficient design method based on the GA application. It allows obtaining fault-tolerant and compact digital systems with partially correct and partially definite automata. The new approach has been illustrated by the example of the heating controller for AN-70 plane.
Interconnection Networks for Parallel and Distributed Processing: An Overview
Authors: H. J. Siegel
Venue: IEEE Transactions on Computers (1981)

CURRENT integrated circuit technology is making feasible computer systems consisting of hundreds or thousands of processors. One of the most difficult problems in the design of large-scale parallel and distributed computer systems is the choice of a communications network. An efficient method is needed for linking the system's processors, memories, and other devices to each other. As can be observed from the papers in this Special Issue, there are many different approaches to the solution of this problem. The best "solution" for a particular system is a function of the system's intended applications, size, speed requirements, cost constraints, etc.
Production design for plate products in the steel industry
Authors: S. Dash, J. Kalagnanam, C. Reddy, S. H. Song
Venue: IBM Journal of Research and Development (2007)

We describe an optimization tool for a multistage production process for rectangular steel plates. The problem we solve yields a production design (or plan) for rectangular plate products in a steel plant, i.e., a detailed list of operational steps and intermediate products on the way to producing steel plates. We decompose this problem into subproblems that correspond to the production stages, where one subproblem requires the design of casts by sequencing slabs which, in turn, have to be designed from mother plates. The design of mother plates consists of a two-dimensional packing problem. We develop a solution approach which combines mathematical programming models with search techniques from artificial intelligence. The use of these tools provides two types of benefits: improvements in the productivity of the plant and an approach to making the key business performance indicators, such as available-to-promise at a production level, operational.
Storage-Efficient Architecture for Routing Tables via Prefix Transformation
Authors: Fong Pong, Nian-Feng Tzeng
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This article deals with a novel architecture for IP routing table construction, on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). The proposed architecture uses two key techniques to lower table storage required drastically: (1) storing transformed prefix representations and (2) accommodating multiple prefixes per table entry via prefix aggregation. Given a set of chosen prefix lengths (called "treads"), all prefixes are rounded down to nearest treads before hashed to the table using their transformed representations so that prefix aggregation opportunities abound in hash entries. Significant table storage reduction makes it possible to fit a large routing table in on-chip SRAM, solving both the memory and bandwidthintensive problems faced by IP routing. Simulation results on real routing tables show that the proposed architecture saves at least two folds of storage when compared with most known hash tablebased design or trie-based design. In addition, our design enjoys fast lookups and incremental updates, with the worst-case lookup time upper-bounded theoretically by the number of treads \zeta) but found experimentally to be 4 memory accesses when\zeta equals 8.
A novel constrained topographic independent component analysis for separation of epileptic seizure signals
Authors: Min Jing, Saeid Sanei
Venue: Computational Intelligence and Neuroscience (2007)

Blind separation of the electroencephalogram signals (EEGs) using topographic independent component analysis (TICA) is an effective tool to group the geometrically nearby source signals. The TICA algorithm further improves the results if the desired signal sources have particular properties which can be exploited in the separation process as constraints. Here, the spatial-frequency information of the seizure signals is used to design a constrained TICA for the separation of epileptic seizure signal sources from the multichannel EEGs. The performance is compared with those from the TICA and other conventional ICA algorithms. The superiority of the new constrained TICA has been validated in terms of signal-to-interference ratio and correlation measurement.
On Two-Level Exclusive-or Majority Networks
Authors: W. E. Robbins
Venue: IEEE Transactions on Computers (1974)

It is shown that not all Boolean functions can be realized by a two-level EXCLUSIVE-OR majority network. However, if repeats at the first level are allowed, then it is shown that such a network is universal. A minimal weight vector with respect to this latter network is defined. By using the restricted-affine-group (RAG) equivalence of Boolean functions, it is shown that if two functions are in the same RAG class, then they are realized by the same minimal weight vector to within permutations and/or sign changes.
Improvements on MB-layer Rate Control Scheme for H.264 video Using complexity estimation
Authors: Yin Ming, Xie Yun, Guo Fen, Cai Shuting
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

To solve the dilemma introduced by rate-distortion optimization (RDO) in H.264 rate control, the linear model of MAD prediction is applied. However, this model suits image characteristics locally but in some cases it could be inefficient. If there is a low spatial correlation (i.e., the encoder is processing pictures with varying characteristics), the MAD estimated by the model does not stand for the complexity resulting in the improper quantization parameter (QP) value and image quality degradation. In this paper, the mean square of AC coefficients is introduced into R-D model instead of MAD. Experiments show that the proposed rate control scheme performs well when compared with JVT-G012.
Querying and Creating Visualizations by Analogy
Authors: Carlos Scheidegger Huy Vo David Koop Juliana Freire, Claudio Silva
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

While there have been advances in visualization systems, particularly in multi-view visualizations and visual exploration, the process of building visualizations remains a major bottleneck in data exploration. We show that provenance metadata collected during the creation of pipelines can be reused to suggest similar content in related visualizations and guide semi-automated changes. We introduce the idea of query-by-example in the context of an ensemble of visualizations, and the use of analogies as first-class operations in a system to guide scalable interactions. We describe an implementation of these techniques in VisTrails, a publicly-available, open-source system.
Just in time learning: implementing principles of multimodal processing and learning for education
Authors: Dominic W. Massaro
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

Baldi, a 3-D computer-animated tutor has been developed to teach speech and language. I review this technology and pedagogy and describe evaluation experiments that have substantiated the effectiveness of our language-training program, Timo Vocabulary, to teach vocabulary and grammar. With a new Lesson Creator, teachers, parents, and even students can build original lessons that allow concepts, vocabulary, animations, and pictures to be easily integrated. The Lesson Creator application facilitates the specialization and individualization of lessons by allowing teachers to create customized vocabulary lists Just in Time as they are needed. The Lesson Creator allows the coach to give descriptions of the concepts as well as corrective feedback, which allows errorless learning and encourages the child to think as they are learning. I describe the Lesson Creator, illustrate it, and speculate on how its evaluation can be accomplished.
On the Relationship Between Dependence Tree Classification Error and Bayes Error Rate
Authors: Kiran S. Balagani, Vir V. Phoha
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Wong and Poon [1] showed that Chow and Liu’s tree dependence approximation can be derived by minimizing an upper bound of the Bayes error rate. Wong and Poon’s result was obtained by expanding the conditional entropy H(w|X). We derive the correct expansion of H(w|X) and present its implication.
How good are your testers? An assessment of testing ability
Authors: Liang Huang, Mike Holcombe
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

During our previous research conducted in the Sheffield Software Engineering Observatory [11], we found that test first programmers spent a higher percentage of their time testing than those testing after coding. However as the team allocation was based on subjects' academic records and their preference, it was unclear if they were simply better testers. Thus this paper proposes two questionnaires to assess the testing ability of subjects, in order to reveal the factors that contribute to the previous findings. Preliminary results show that the testing ability of subjects, as measured by the survey, varies based on their professional skill level.
Learning Effective Oracle Comparator Combinations for Web Applications
Authors: Sara Sprenkle, Emily Hill, Lori Pollock
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

30350372
Assessing Failure of Bridge Construction Using Fuzzy Fault Tree Analysis
Authors: Nang-Fei Pan, Huaitien Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Estimating exact probabilities of occurrence of bridge failure for the use in the conventional fault tree analysis (FTA) is difficult when fault events are imprecise such as human error. A fuzzy FTA model employing fuzzy sets and possibility theory to tackle this problem is proposed. An example of the collapse of cantilever gantry during construction demonstrates the capability of this approach that can assist safety engineer to better evaluate bridge performance.