ppxscal/embedding_network huggingface dataset:
Special Issue: Temporal Logic in Engineering
Authors: Ephraim Nissan
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

Logic-based models are thriving within artificial intelligence. A great number of new logics have been defined, and their theory investigated. Epistemic logics introduce modal operators for knowledge or belief; deontic logics are about norms, and introduce operators of deontic necessity and possibility (i.e., obligation or prohibition). And then we have a much investigated class&mdash;temporal logics&mdash;to whose application to engineering this special issue is devoted. This kind of formalism deserves increased widespread recognition and application in engineering, a domain where other kinds of temporal models (e.g., Petri nets) are by now a fairly standard part of the modelling toolbox.
General-purpose computation with neural networks: a survey of complexity theoretic results
Authors: Jiří Šíma, Pekka Orponen
Venue: Neural Computation (2003)

We survey and summarize the literature on the computational aspects of neural network models by presenting a detailed taxonomy of the various models according to their complexity theoretic characteristics. The criteria of classification include the architecture of the network (feedforward versus recurrent), time model (discrete versus continuous), state type (binary versus analog), weight constraints (symmetric versus asymmetric), network size (finite nets versus infinite families), and computation type (deterministic versus probabilistic), among others. The underlying results concerning the computational power and complexity issues of perceptron, radial basis function, winner-take-all, and spiking neural networks are briefly surveyed, with pointers to the relevant literature. In our survey, we focus mainly on the digital computation whose inputs and outputs are binary in nature, although their values are quite often encoded as analog neuron states. We omit the important learning issues.
An Indexing Standard for Sharing Health Education Multimedia Resources: The Health Education Assets Library (HEAL) Metadata Schema
Authors: Sharon E. Dennis, Shona R. Dippie, Chris S. Candler, Sandra A. McIntyre, Sebastian Uijtdehaage
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

Health sciences educators are increasingly incorporating multimedia (including images, animations, and videos) into educational materials such as PowerPoint lectures, Web sites, and interactive quizzes and cases. Educators continue to "reinvent the wheel" and develop costly duplicates of multimedia resources, despite new opportunities offered by the Internet to share resources. The Health Education Assets Library (HEAL) is designed to provide health sciences educators with freely available, high quality multimedia materials to augment health sciences education. We describe an XML schema that we created to index the health sciences multimedia resources in HEAL. The metadata schema provides a common mechanism by which remotely located distributed systems may share metadata records, allowing the end user to search many collections through one interface.
Maximizing Interval Reliability in Operational Software System with Rejuvenation
Authors: Hiroyuki Suzuki, Tadashi Dohi, Naoto Kaio, Kishor S. Trivedi
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Software aging often affects the performance of a softwaresystem and eventually causes it to fail. A novel approachto handle transient software failures is called softwarerejuvenation which can be regarded as a preventiveand proactive solution that is particularly useful for counteractingthe phenomenon of software aging. In this paper,we consider the optimal software rejuvenation policy maximizingthe interval reliability in the general semi-Markovframework. We derive analytically the optimal softwarerejuvenation timing which maximizes the limiting intervalreliability or the interval reliability with exponentially distributedoperation times. Further, we examine numericallythe transient behavior of the interval reliability at an arbitraryoperation time. Our results under the interval reliabilitycriteria are extentions of some earlier work, sincethe interval reliability can be specialized to the pointwiseavailability and the common reliability function.
Improvement of the Miyazaki--Takaragi threshold digital signature scheme
Authors: Tzong-Sun Wu, Chien-Lung Hsu, Han-Yu Lin, Po-Sheng Huang
Venue: Information Processing Letters (2003)

To enhance the applications of smart cards, Miyazaki and Takaragi recently proposed a (t,n) threshold digital signature scheme based on the security of elliptic curve discrete logarithm problem (ECDLP). The advantages of their scheme are low communication bandwidth and computational complexity, which provides critical benefits for the use of smart cards in the distributed environments. Unfortunately, this paper will show that their scheme cannot withstand the forgery attack, which violates their security claim. We further amend the scheme against the attack with a simple improvement.
On probabilistic switch-level simulation for asynchronous circuits
Authors: Suresh Rajgopal, Akhilesh Tyagi
Venue: Proceedings of the conference on European design automation (1991)

The delay information useful in asynchronous circuits is not the same as in synchronous circuits. Rather than using the worst case delay, usually computed by a critical path analysis, the average case delay over a set of input assignments is a more relevant parameter for an asynchronous system. We present a novel, probability-propagation based algorithm to compute the average case switch-level delays. We discuss an implementation of this algorithm which is built on top of RNL, an event-driven switch-level simulator. This implementation takes the same order of time that RNL takes to simulate for one input assignment for determining the average case delays.
Performance Analysis of cdma2000 MAC Layer with Voice/Data Integration
Authors: Fernando Agustín Domínguez Ferrer, César Vargas Rosales
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

The cdma2000 system is one of the strongestcontenders for wireless data networking and providesnext generation capacity. cdma2000 includes asophisticated MAC feature which can concurrentlysupport multiple data and voice services, thuseffectively supporting very high data rates. In thisarticle we study the performance of the MAC statesdefined in cdma2000. The proposed model has thecapability of proportionally combining threeparameters: channel utilization, waiting time and thesaving in the signalling overhead. We study the effectof integrating a voice service and two data serviceswith different characteristics. Since the true nature ofthe wireless data is yet unknown, we use a mix ofPoisson distributed voice packets and Paretodistributed data packets. We derive analyticalexpressions and also obtain numerical evaluations tostudy the nature of the performance curve.
Improving the usability of the hierarchical file system
Authors: Gary Marsden, David E. Cairns
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

Whether you are interested in improving the usability of Linux, Macintosh or Windows, there is one restriction you cannot escape -- the hierarchical file storage system. The notion of files and folders has been with us for so long that it almost seems axiomatic. In this paper we look at the effects on users of forcing a hierarchical classification of files. We also consider how some of the resultant problems can be tackled with a new piece of file browsing software based on the ideas of relational database systems.
A New Approach to the Design of a DELTA Robot with a Desired Workspace
Authors: Xin-Jun Liu, Jinsong Wang, Kun-Ku Oh, Jongwon Kim
Venue: Journal of Intelligent and Robotic Systems (2004)

In this paper, a new design method considering a desired workspace and swing range of spherical joints of a DELTA robot is presented. The design is based on a new concept, which is the maximum inscribed workspace proposed in this paper. Firstly, the geometric description of the workspace for a DELTA robot is discussed, especially, the concept of the maximum inscribed workspace for the robot is proposed. The inscribed radius of the workspace on a workspace section is illustrated. As an applying example, a design result of the DELTA robot with a given workspace is presented and the reasonability is checked with the conditioning index. The results of the paper are very useful for the design and application of the parallel robot.
Parallel 'go with the winners' algorithms in distributed memory models
Authors: Marcus Peinado, Thomas Lengauer
Venue: Journal of Parallel and Distributed Computing (2003)

We parallelize the 'go with the winners' algorithm of Aldous and Vazirani (in: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Silver Spring., MD, 1994, pp. 492-501) and analyze the resulting parallel algorithm in the LogP-model (in: Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 1993, pp. 1-12). The main issues in the analysis are load imbalances and communication delays. The result of the analysis is a practical algorithm which, under reasonable assumptions, achieves linear speedup. Finally, we analyze our algorithm for a concrete application: generating models of amorphous chemical structures.
Fuzzy sets in seismic inelastic analysis and design of reinforced concrete frames
Authors: Euripides S. Mistakidis, Dimitris N. Georgiou
Venue: Advances in Engineering Software (2003)

In this paper, a new approach to the problem of estimating the structural response of systems with uncertain characteristics is presented. The approach is based on the theory of fuzzy sets, which allow the designers to describe the uncertain variables. The method is presented briefly in the following. First, the uncertain parameters are expressed as fuzzy numbers with specific characteristics. The concurrent effect of the various uncertainties on the structural response is obtained by applying methodologies of the theory of fuzzy sets. Then the output parameters of the design process as, e.g. the displacements or the stresses of the structure are obtained as new fuzzy numbers expressing the uncertainties of the output parameters. Finally, numerical applications on a number of relatively simple structural systems give an idea of the applicability of the proposed methodology in various aspects of the design process.
Models of translational equivalence among words
Authors: I. Dan Melamed
Venue: Computational Linguistics (2000)

Parallel texts (bitexts) have properties that distinguish them from other kinds of parallel data. First, most words translate to only one other word. Second, bitext correspondence is typically only partial---many words in each text have no clear equivalent in the other text. This article presents methods for biasing statistical translation models to reflect these properties. Evaluation with respect to independent human judgments has confirmed that translation models biased in this fashion are significantly more accurate than a baseline knowledge-free model. This article also shows how a statistical translation model can take advantage of preexisting knowledge that might be available about particular language pairs. Even the simplest kinds of language-specific knowledge, such as the distinction between content words and function words, are shown to reliably boost translation model performance on some tasks. Statistical models that reflect knowledge about the model domain combine the best of both the rationalist and empiricist paradigms.
Continuous Design
Authors: Jim Shore
Venue: IEEE Software (2004)

The author has been experimenting with continuous design, the process of using refactoring to continuously improve a program's design, for four years. Initially a skeptic, he now admits it's changed the way he programs. He explains where and how he used it and what you need to try it: automated tests, a team-based approach to changes (such as collective code ownership), and commitment to continuously evaluating and improving your design in the face of schedule pressure. He suggests you'll end up with better, simpler, more maintainable code.
On the Twisted Cubic of PG(3, q)
Authors: G. Lunardon, O. Polverino
Venue: Journal of Algebraic Combinatorics: An International Journal (2003)

In this paper we classify the lines of PG(3, q) whose points belong to imaginary chords of the twisted cubic of PG(3, q). Relying on this classification result, we obtain a complete classification of semiclassical spreads of the generalized hexagon H(q).
Computer augmented teacher training
Authors: Portia C. Elliott, Howard A. Peelle
Venue: ACM SIGCUE Outlook (1975)

A new teacher education program has been inaugurated at the University of Massachusetts' School of Education under the title "Computer Augmented Teacher Training". The CATT program places the computer in a central role--particularly the activity of programming--in order to augment the cognitive, affective, and social competencies of prospective mathematics teachers. In the cognitive domain, teachers learn <u>what</u> mathematics <u>to teach</u> as well as <u>how to teach</u> it effectively. In the affective domain, teachers enhance their <u>self-concepts</u> and build <u>self-confidence</u> by encountering both successes and failures in working with manipulative materials, self-instructional texts, and computer-related activities. Finally, in the social area, teachers raise their consciousness about the advantages and limitations of technology as they develop <u>computer literacy</u>.
Using image processing to teach CS1 and CS2
Authors: Kenny Hunt
Venue: ACM SIGCSE Bulletin (2003)

The use of digital image processing techniques in undergraduate computer science curriculum has advantages in terms of motivating student interest and immediate, visual feedback of executed code. Although the standard Java distribution includes support for basic image processing operations, including the display of images, the complexity of the package renders it unsuitable for inexperienced programmers. This paper presents an extension to the built-in image processing package that is suitable for use in CS1 and CS2 courses and suggests ways that the package can be used to teach topics in these courses.
Toward achieving universal usability for older adults through multimodal feedback
Authors: V. Kathlene Emery, Paula J. Edwards, Julie A. Jacko, Kevin P. Moloney, Leon Barnard, Thitima Kongnakorn, François Sainfort, Ingrid U. Scott
Venue: Issue 73-74 (June-September 2002) (2002)

This experiment examines the effect of combinations of feedback (auditory, haptic, and/or visual) on the performance of older adults completing a drag-and-drop computer task. Participants completed a series of drag-and-drop tasks under each of seven feedback conditions (3 unimodal, 3 bimodal, 1 trimodal). Performance was assessed using measures of efficiency and accuracy. For analyses of results, participants were grouped based on their level of computer experience. All users performed well under auditory-haptic bimodal feedback and experienced users responded well to all multimodal feedback. Based on performance benefits for older adults seen in this experiment, future research should extend investigations to effectively integrate multimodal feedback into GUI interfaces in order to improve usability for this growing and diverse user group.
Evaluation of Supervisory vs. Peer-Peer Interaction with Human-Robot Teams
Authors: Julie L. Marble, David J. Bruemmer, Douglas A. Few, Donald D. Dudenhoeffer
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

We submit that the most interesting and fruitful human-robot interaction (HRI) may be possible when the robot is able to interact with the human as a true team member, rather than a tool. However, the benefits of shared control can all too easily be overshadowed by challengesinherent to blending human and robot initiative. The most important requirements for peer-peer interaction are system trust and ability to predict system behavior. The human must be able to understand the reason for and effects of robot initiative. These requirements can only be met through careful application of human factors principles and usability testing to determine how users will interact with the system. This paper discusses the recent human participant usability testing, which took our current implementation to task using a search and rescue scenario within a complex, real-world environment. The purpose of testing was to examine how human operators work with the robotic system at each level of autonomy, and how interaction with the robot should be structured to enable situation awareness and task completion. Analyses revealed that our architecture equally supported situation awareness and target detection by novices and experts, although experienced users were more likely to have more performance expectations of the interface. Results also had implications regarding the ability of participants to effectively utilize the collaborative workspace and, most importantly, their ability to understand and willingness to accept robot initiative.
Foundations of Descriptology
Authors: V. N. Red'Ko
Venue: Cybernetics and Systems Analysis (2003)

The concept of a description as a descriptive process is explained, in particular, as a process of construction of a program. Based on it, a universal static-dynamic platform is constructed. In this platform, contrary to the set-theoretic platform, dynamic entities dominate over static ones. On this platform, the concepts of universal descriptive logic and a descriptive system are explicated.
Secure and robust censorship-resistant publishing systems
Authors: David Mazieres
Venue:  (2003)

In many cases, censoring documents on the Internet is a fairly simple task. Almost any published document can be traced back to a specific host, and from there to an individual responsible for the material. Someone wishing to censor this material can use the courts, threats, or other means of intimidation to compel the relevant parties to delete the material or remove the host from the network. Even if these methods prove unsuccessful, various denial of service attacks can be launched against a host to make the document difficult or impossible to retrieve. Unless a host's operator has a strong interest in preserving a particular document, removing it is often the easiest course of action. A censorship-resistant publishing system allows an individual to publish a document in such a way that it is difficult, if not impossible, for an adversary to completely remove, or convincingly alter, a published document. One useful technique for ensuring document availability is to replicate the document widely on servers located throughout the world. However, replication alone does not block censorship. Replicas need to be protected from accidental or malicious corruption. In addition, a censorship-resistant publishing system needs to address a number of other important issues, including protecting the publisher's identity while simultaneously preventing storage flooding attacks by anonymous users. This dissertation presents the design and implementation of two very different censorship-resistant publishing systems. The first system. Publius, is a web based system that allows an individual to publish, update, delete and retrieve documents in a secure manner. Publius's main contributions include an automatic tamper checking mechanism, a method for updating or deleting anonymously published content and methods for publishing anonymously hyperlinked content. The second system, Tangler, is a peer-to-peer based system whose contributions include a unique publication mechanism and a dynamic self-policing network. The benefits of this new publication mechanism include the automatic replication of previously published content and an incentive to audit the reliability with which servers store content published by other people. In part through these incentives, the self-policing network identifies and ejects servers that exhibit faulty behaviour.
Design of RF Tuner for Cable Modem Applications
Authors: V. Veeresh Babu, Sumantra Seth, A. N. Chandorkar
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

An integrated RF tuner, operating in 40MHz- 900MHzbandwidth for cable modem is presented using TSMC0.35µm (four metal, double poly) process. RF tuners alwayshave external components which increases boardspace and cost. The complete monolithic RF tuner will bea cost, area and power efficient solution for DOCSIS standardhigh speed (10Mbps - 30Mbps) cable modems. Thedesigned RF tuner has an end to end gain of 0 dB, and adjacentchannel rejection of -34 dB without any external SAWfilters. The total area is 3m.m. x 3m.m. with a power consumptionof 680mW with a 3.3V supply.
On the number of fixed points of a combinator in lambda calculus
Authors: B. Intrigila, E. Biasone
Venue: Mathematical Structures in Computer Science (2000)

We consider the problem of determining the number of fixed points of a combinator (a closed &lambda;-term). This appears to be a still unsolved problem. We give a partial answer by showing that if there is a fixed point in normal form, then this fixed point is unique or there are infinitely many fixed points.
Information Service on Scalable Ad-Hoc Mobile Wireless Networks
Authors: Yueh-Min Huang, Hua-Yi Lin
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Mobile Ad-Hoc NETworks (MANETs) is one of the new services with a dynamic configuration. It is hard to manage since the topology is frequently changed and growing up. So far, there are not many sound studies focusing on a large scale Ad-Hoc service model due to its complexity. Therefore, it is an important feature for a MANET with a complete Ad-Hoc topology information service. In this paper, we present an information services model based onAHDT (Ad-Hoc Domain Tree). With AHDT, the information about every mobile terminal's characteristic can be rapidly investigated of the wireless environment within an Ad-Hoc Domain.This model supports mobile hosts to make a services decision correctly.
The CAMIL programming language
Authors: David C. Pflasterer
Venue: ACM SIGPLAN Notices (1978)

This paper briefly descrbes the Computer Assisted/Managed Instructional Language (CAMIL), a language developed for applications in computer assisted and computer managed instruction. The language is general purpose in that it is also usable for systems and applications programming. To provide a truly general purpose capability, a design which divides the language into two sublanguages, Basic and Extended CAMIL, was implemented. Covered in the paper are (1) the portions of the language which are unique to CAMIL and which deviate from the traditional constructs found in many languages (including an implementation of data abstractions which serves as an alternative to the approach taken in CLU and ALPHARD); and (2) short descriptions of constructs available which are similar to or deviate slightly from traditional language constructs.
An Evolutionary Design Algorithm for Ring-based SDH optical core networks
Authors: L. He, C. P. Botham, C. D. O'Shea
Venue: BT Technology Journal (2004)

This paper presents a ring-based SDH optical core network design problem with multiple constraints. A novel evolutionary algorithm (EA) is developed to successfully find near-optimal solutions for a realistic case study. Compared to a genetic algorithm, this EA is demonstrated to be more efficient and effective by experimental simulation results, and shows promise for tackling ring-based network design problems.