ppxscal/embedding_network huggingface dataset:
SOVA - software environment for NLU of Slovenian language: U. of Edvard Kardelj in Ljubljana, Yugoslavia
Authors: Peter Tancig
Venue: Issue 79 (January 1982) (1982)

The field of natural language processing already has quite a tradition in Yugoslavia but research is lacking in AI related areas, such as natural language understanding (NLU) and knowledge representation. In order to establish sound software support for such research we have been developing a system named SOVA.
Optimal path planning of mobile robots for sample collection
Authors: J. C. Cardema, P. K. C. Wang, G. Rodriguez
Venue: Journal of Robotic Systems (2004)

In this paper, the problem of path planning for sample collection using single or multiple mobile robots such as Mars rovers is formulated as a mathematical optimization problem involving a performance metric based on the scientific values of the collected rock and soil samples. The posed optimization problem is NP-hard and more complex than the well-known Traveling Salesman Problem. Algorithms are proposed for obtaining near-optimal solutions for both single and multiple robots. Their application is illustrated using real Mars surface data. The dependence of the optimal performance on the number of mobile robots is studied numerically. &copy; 2004 Wiley Periodicals, Inc.
Conventional and Open Source Software Reuse at Orbotech - An Industrial Experience
Authors: Shlomit Morad, Tsvi Kuflik
Venue: Proceedings of the IEEE International Conference on Software - Science, Technology & Engineering (2005)

Orbotech, as part of the Israeli Software Reuse Industrial Consortium (ISWRIC), explored the possibilities of software reuse in a three-year project, supported by the Israel Ministry of Trade and Commerce. The positive economical results of the project made software reuse a common practice at Orbotech. Further experimentation of reusing Open Source Software (OSS) demonstrated the high potential of that approach, when carefully integrated with the standard organizational development process. The conclusions from Orbotech experience are that when carefully planned and implemented, software reuse provides the anticipated benefits of cost reduction, improved quality and shorter Time-to-Market. The reuse of OSS may provide even higher benefits than conventional software reuse. Nevertheless, as in many cases before, implementation of software reuse requires management support and commitment, as well as acceptance by the developers themselves. As such, software reuse implementation proves to be a complex task that needs to be tailored specifically to the implementing organization.
The BankSearch web document dataset: investigating unsupervised clustering and category similarity
Authors: Mark P. Sinka, David W. Corne
Venue: Journal of Network and Computer Applications (2005)

Targeting useful and relevant information on the internet is a highly complicated research area, which is served in part by research into document clustering. A foundational aspect of such research (proven over and over again in other research disciplines) is the use of standard datasets, against which different techniques can be properly benchmarked and assessed. We argue that, so far in this broad area of research, as many datasets have been used as research papers written, thus preventing confident reasoning about the relative performance of different techniques used in different publications. We describe a solution to this problem with the compilation of the BankSearch dataset, a proposed standard dataset suitable for a wide range of web-intelligence related research activities. At the time of writing, this dataset has already become a popular download in the Statlib archive, and is in use for benchmarking of a variety of document processing and web search techniques. Herein we also use the dataset in experiments to investigate certain issues in unsupervised web document clustering. Our main interest is how unsupervised clustering performance varies with the relative 'distance' between the categories inherent in the data, and how this is affected by the use of stemming and stoplists. These issues relate to, among other things, the design of useful search engines. We use simple K-means clustering, and find, unsurprisingly, that performance improves as categories become more distant. However, we also find that very close categories can be distinguished with fair accuracy, and there are interesting results concerning the use of stemming. Stop-word removal is confirmed as universally helpful, but stemming is not always to be recommended on 'distant' categories.
A software engineering code obfuscation project
Authors: Charles Ashbacher
Venue: Journal of Computing Sciences in Colleges (2004)

In the Spring term of 2003, I taught the upper level computer science major class CS 400 Software Engineering at Mount Mercy College for the first time. Rather than present a series of formulas of software creation metrics and diagrams of software development strategies, I decided to have the students build a significant and useful project. My choice was to have them build a code obfuscation program in the language Java. This choice of language was due to the many methods available to perform String processing, which is essentially what the project was. This paper is a report on that project as well as an announcement of the open source availability of the code.Our first step was to write a series of coding specifications for the project, and cover enough of the Unified Modeling Language (UML) so that we had a common set of conditions and a common language used to represent the design. The class was split into two groups of five and the project went through four iterations. For each iteration, there were two separate parts and at the start, each group was given a description of the requirements for one part of the iteration. The group then wrote the specifications for that part and then each handed the other their specifications, so each group wrote code conforming to the other group's written specifications. At the end, each group was required to submit complete formal documentation for all their code and the groups submitted a working copy of the code obfuscator containing the code integrated from both teams. Over 100 pages of documentation were submitted and the final program is estimates to be over 10,000 lines of code, which includes internal documentation.
Book review: MACHINE LEARNING: A Guide to Current Research by T. M. Mitchell, J. G. Carbonell, R. S. Michalski (Kluwer Academic Publishers)
Venue: Issue 103 (Jan., 1988) (1988)

Considering my reaction to the first edition of LISP LORE: A Guide to Programming the LISP Machine (see Sigart #100, I generally liked it, but the operating system changed), I was pleased to see a second. This new edition is based on the first with substantial additions and rewriting (by Richard Lamson of Symbolics) to account for the changes made by Symbolics between version 6.1 and 7.0 of their system. The book is somewhat expanded and rearranged (flavors are no longer the first topic that is introduced) with new example programs (as before, source is also available on tape). 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
An FPGA-based coprocessor for real-time fieldbus traffic scheduling: architecture and implementation
Authors: Ernesto Martins, Luis Almeida, José Alberto Fonseca
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2005)

Distributed computer control systems used nowadays in the industry need often to meet requirements of on-line reconfigurability so they can adjust dynamically to changes in the application environment or to evolving specifications. The communication network connecting the computer nodes, commonly a fieldbus system, must use therefore dynamic scheduling strategies, together with on-line admission control procedures that test the validity of all changes in order to guarantee the satisfaction of real-time constraints. These are both very computationally demanding tasks, something that has precluded their wide adoption. However, these algorithms also embed sufficient levels of parallelism to grant them benefits from implementations in dedicated hardware.This paper presents a scheduling coprocessor that executes dynamic real-time traffic scheduling and schedulability analysis. The FPGA-based implementation described here supports multiple scheduling policies and was tailored for the FTT-CAN protocol, but it can be used also in other fieldbuses relying on centralized scheduling. The coprocessor generates schedules in about two orders of magnitude less time than any practical network elementary cycle duration. The time to execute a schedulability test is deterministic. An evaluation based on the SAE benchmark yielded a worst-case execution time of 1.4 ms.The paper starts by discussing the scheduling problem being addressed. It describes then the coprocessor functionality and architecture, highlighting important design decisions, and its latest implementation. Finally the coprocessor performance evaluation is presented.
Nonlinearity of the population activity to transparent motion
Authors: Osamu Watanabe, Masayuki Kikuchi
Venue: Neural Networks (2005)

How to represent transparent motion with neuronal populations is important problem for the theory of multiple motion detection. Previous models are based on the assumption that the population activity to transparent motion is proportional to a linear combination of the responses to individual motions. However, there is a possibility that the population activity becomes a nonlinear combination of each motion's component due to the interference, or cross-talk, between two moving patterns. Here we show the model analysis of how a neuronal population represents multiple motions with the spatiotemporal energy model. The model analysis indicates there is a special case that the interference leads to the nonlinearity in the population response, although the linear combination assumption is satisfied in general. This special case corresponds to locally-paired-dot (LPD) stimuli that produce no transparency. Computer simulations show that a simple model for motion detection falls to discriminate two overlapping motions in this case due to the nonlinearity in population responses, and this failure is similar to human perception in LPD stimuli. This result suggests that non-transparency perception in LPD stimuli is naturally explained by the nonlinear property of neuronal responses.
Using XForms to simplify Web programming
Authors: Richard Cardone, Danny Soroker, Alpana Tiwari
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

The difficulty of developing and deploying commercial web applications increases as the number of technologies they use increases and as the interactions between these technologies become more complex. This paper describes a way to avoid this increasing complexity by re-examining the basic requirements of web applications. Our approach is to first separate client concerns from server concerns, and then to reduce the interaction between client and server to its most elemental: parameter passing. We define a simplified programming model for form-based web applications and we use XForms and a subset of J2EE as enabling technologies. We describe our implementation of an MVC-based application builder for this model, which automatically generates the code needed to marshal input and output data between clients and servers. This marshalling uses type checking and other forms of validation on both clients and servers. We also show how our programming model and application builder support the customization of web applications for different execution targets, including, for example, different client devices.
Optimal Sub-Shape Models by Minimum Description Length
Authors: Georg Langs, Philipp Peloschek, Horst Bischof
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Active shape models are a powerful and widely used tool to interpret complex image data. By building models of shape variation they enable search algorithms to use a priori knowledge in an efficient and gainful way. However, due to the linearity of PCA, non-linearities like rotations or independently moving sub-parts in the data can deteriorate the resulting model considerably. Although non-linear extensions of active shape models have been proposed and application specific solutions have been used, they still need a certain amount of user interaction during model building. In this paper the task ofbuilding/choosing optimal models is tackled in a more generic information theoretic fashion. In particular, we propose an algorithm based on the minimum description length principle to find an optimal subdivision of the data into sub-parts, each adequate for linear modeling. This results in an overall more compact model configuration. Which in turn leads to a better model in terms of modes of variations. The proposed method is evaluated on synthetic data, medical images and hand contours.
Extrapolated impulse response filter and its application in the synthesis of digital filters using the frequency-response masking technique
Authors: Y. J. Yu, K. L. Teo, Y. C. Lim, G. H. Zhao
Venue: Signal Processing (2005)

Techniques based on the frequency-response masking (FRM) approach are known to be highly effective for reducing the number of multipliers and adders in linear-phase finite-impulse response (FIR) filters. The basic FRM structure comprises a band-edge shaping filter and two masking filters. It is observed that the impulse response of the band-edge shaping filter of an FRM structure exhibits a quasi-periodic property. Previous study showed that lowpass or highpass digital FIR filters, whose impulse responses are quasi-periodic, can be synthesized using extrapolated impulse response technique, which leads to structure with much reduced arithmetic complexity. In this paper, an implementation of the extrapolated impulse response filter is presented. An FRM technique incorporating extrapolated impulse response band-edge shaping filter is introduced. An iterative optimization procedure is proposed to design the FRM sub-filters. It is demonstrated using an example taken from the literature that our new technique produces a saving of over 20% in the number of multipliers used.
University of Massachusetts: MUC-4 test results and analysis
Authors: W. Lehnert, C. Cardie, D. Fisher, J. McCarthy, E. Riloff, S. Soderland
Venue: Proceedings of the 4th conference on Message understanding (1992)

The UMass/MUC-4 system is based on a form of sentence analysis known as selective concept extraction. This approach to language processing is distinguished by a minimal reliance on syntactic sentence analysis, along with a minimal dictionary customized to operate in a limited domain. Last year, the UMass/MUC-3 system demonstrated the viability of selective concept extraction, but serious questions were raised about the portability and scalability of the technology, particularly with respect to the creation of domain-dependent and task-dependent dictionaries. We estimated that 9 person/months went into the creation of the dictionary used by UMass/MUC-3, and we were unable to say how much domain-dependent lexicon was still missing. We were nevertheless sure that our dictionary coverage was incomplete.
Multi-discipline-reengineering/redevelopment of IT-infrastructures
Authors: Thomas H. Lenhard
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

In this study / paper, an overview of the complexity of reengineering IT-infrastructures will be given. After the Introduction regarding the necessity of reengineering and the declaration of study-related definitions, several facets of reengineering will be explained. According to the general idea that computer science can't in itself end, this study is naturally based on the theoretic basics of information technology and at the same time on empirical knowledge about the practice of redevelopment/reengineering of IT-systems. Finally a draft of a general model of system-reengineering will be introduced.
An approach to ECL module placement
Authors: Mike Pluimer
Venue: ACM SIGDA Newsletter (1979)

Placement algorithms for general logic graphs or interconnected modules exist in many forms with the acceptability of a given algorithm being dependent upon the set of design constraints imposed. This paper outlines an approach for the placement of ECL modules on a printed circuit board combining existing placement concepts and an evaluational technique called sequential netting. The primary design constraints are assumed to be in the form of rigid wiring rules.
Design of a Distributed P2P-Based Grid Content Management Architecture
Authors: Qian Zhang, Yu Sun, Zheng Liu, Xia Zhang, Xuezhi Wen
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

The development of information technologies and the expansion of the Internet have brought us to an environment, which is filled with huge amounts of information. A number of content management systems have appeared which aim to support the management of these large amounts of content. Many CMS solutions are currently based on client/server model with a central server for storage and management. However, such centralized systems lack scalability and reliability. P2P-based CMS solutions can solve the scalable problem, but they have some shortcomings such as security, reliability, etc. We present a P2P-based content management architecture (PCMA) with some Grid properties such as security, reliability, etc., which combines the advantages of the above two models and avoids their shortcomings. PCMA can exactly discovery services and scales much better.
HLA real-time extension: Research Articles
Authors: Hui Zhao, Nicolas D. Georganas
Venue: Concurrency and Computation: Practice Experience (2004)

The IEEE 1516 Standard &lsquo;High Level Architecture (HLA)&rsquo; and its implementation &lsquo;Run-Time Infra-structure (RTI)&rsquo; defines a general-purpose network communication mechanism for Distributed Interactive Simulation (DIS). However, it does not address real-time requirements of DIS. Current operating system technologies can provide real-time processing through some real-time operating systems (RTOSs) and the Internet is also moving to an age of Quality of Service (QoS), providing delay and jitter bounded services. With the availability of RTOSs and IP QoS, it is possible for HLA to be extended to take advantage of these technologies in order to construct an architecture for Real-Time DIS (RT-DIS). This extension will be a critical aspect of applications in virtual medicine, distributed virtual environments, weapon simulation, aerospace simulation and others.This paper outlines the current real-time technology with respect to operating systems and at the network infrastructure level. After summarizing the requirements and our experiences with RT-DIS, we present a proposal for HLA real-time extension and architecture for real-time RTI. Similar to the growth of real-time CORBA (Common Object Request Broker) after the mature based CORBA standard suite, Real-Time HLA is a natural extension following the standardization of HLA into IEEE 1516 in September 2000. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Effectively Mining and Using Coverage and Overlap Statistics for Data Integration
Authors: Zaiqing Nie, Subbarao Kambhampati, Ullas Nambiar
Venue: IEEE Transactions on Knowledge and Data Engineering (2005)

Recent work in data integration has shown the importance of statistical information about the coverage and overlap of sources for efficient query processing. Despite this recognition, there are no effective approaches for learning the needed statistics. The key challenge in learning such statistics is keeping the number of needed statistics low enough to have the storage and learning costs manageable. In this paper, we present a set of connected techniques that estimate the coverage and overlap statistics,while keeping the needed statistics tightly under control. Our approach uses a hierarchical classification of the queries and threshold-based variants of familiar data mining techniques to dynamically decide the level of resolution at which to learn the statistics. We describe the details of our method,and present experimental results demonstrating the efficiency of the learning algorithms and the effectiveness of the learned statistics over both controlled data sources and in the context of BibFinder with autonomous online sources.
Constructing (Almost) phylogenetic trees from developmental sequences data
Authors: Ronnie Bathoorn, Arno Siebes
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

In this paper we present a new way of constructing almost phylogenetic trees. Almost since we reconstruct the tree, but without the timestamps. Rather than basing the tree on genetic sequence data ours is based on developmental sequence data. Using frequent episode discovery and clustering we reconstruct the consensus tree from the literature almost completely.
Reliable bursty convergecast in wireless sensor networks
Authors: Hongwei Zhang, Anish Arora, Young-ri Choi, Mohamed G. Gouda
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

We address the challenges of bursty convergecast in multi-hop wireless sensor networks, where a large burst of packets from different locations needs to be transported reliably and in real-time to a base station. Via experiments on a 49 MICA2 mote sensor network using a realistic traffic trace, we determine the primary issues in bursty convergecast, and accordingly design a protocol, RBC (for Reliable Bursty Convergecast), to address these issues: To improve channel utilization and to reduce ack-loss, we design a window-less block acknowledgment scheme that guarantees continuous packet forwarding and replicates the acknowledgment for a packet; to alleviate retransmission-incurred channel contention, we introduce differentiated contention control. Moreover, we design mechanisms to handle varying ack-delay and to reduce delay in timer-based re-transmissions. We evaluate RBC, again via experiments, and show that compared to a commonly used implicit-ack scheme, RBC doubles packet delivery ratio and reduces end-to-end delay by an order of magnitude, as a result of which RBC achieves a close-to-optimal goodput.
Design and Realization of ebXML Registry Classification Model Based on Ontology
Authors: Wei Liu, Keqing He, Wudong Liu
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In Web Service, one of the essential requirements in e-business is to classify and register the complex information. How to describe the registry classification information and construct the registry classification model is a keystone of realizing complex information classification and registry in ebXML/R&R system. Semantic Web is an important initiative in this respect, we introduce ontology into the description of registry classification information and describe registry classification information ontology with OWL, and then we retrieve a registry classification model (RCM) to manage the registry classification information specially, which is abstracted from ebXML/RIM. Finally, an example of constructing the ebXML/R&R classification model based ontology is presented to illustrate the approach. The study of registry classification model based on ontology has theoretic and practical significance for realizing the interoperability between ebXML/R&R and other information source R&R classification registry technology.