TY - CHAP TI - On the design of dynamic reconfiguration policies for broadcast WDM networks AU - Baldine, I AU - Rouskas, GN AU - Senoir, JM AU - Qiao, C T2 - All-Optical Networking: Architecture, Control, and Management Issues AB - We study the issues arising when considering the problem of reconfiguring broadcast optical networks in response to changes in the traffic patterns. Although the ability to dynamically optimize the network under changing traffic conditions has been recognized as one of the key features of multiwavelength optical networks, this is the first in-depth study of the trade-offs involved in carrying out the reconfiguration process. Our contribution is three-fold. First, we identify the degree of load balancing and the number of retunings as two important, albeit conflicting, objectives in the design of reconfiguration policies. Second, we formulate the problem as a Markovian Decision Process and we develop a systematic and flexible framework in which to view and contrast reconfiguration policies. Third, we also show how an appropriate selection of reward and cost functions can be used to achieve the desired balance among various performance criteria of interest. Our work demonstrates that it is practical to apply Markov Decision Process theory to obtain optimal reconfiguration policies even for networks of large size. The advantages of optimal policies over a class of threshold-based policies are also illustrated through numerical results. PY - 1998/// DO - 10.1117/12.327053 VL - 3531 SP - 146-157 PB - SE - ER - TY - CHAP TI - Dynamic load balancing in broadcast WDM networks with tuning latencies AU - Baldine, I AU - Rouskas, GN AU - IEEE T2 - Ieee Infocom '98 - the Conference on Computer Communications, Vols. 1-3 PY - 1998/// SP - 78-85 PB - SE - ER - TY - JOUR TI - An object oriented distributed working environment to integrate cooperative work and personal work AU - Ochi, T. AU - Matsuda, N. AU - Okamoto, T. T2 - Transactions of Information Processing Society of Japan DA - 1998/// PY - 1998/// VL - 39 IS - 1 SP - 123–130 ER - TY - RPRT TI - Principles of Standardization AU - Singh, Munindar P. A3 - Foundation of Intelligent Physical Agents (FIPA) DA - 1998/1// PY - 1998/1// PB - Foundation of Intelligent Physical Agents (FIPA) ER - TY - BOOK TI - Book review of Michael Schroeder, Autonomous, Model-Based Diagnosis Agents AU - Singh, Munindar P. AU - Schroeder, Michael DA - 1998/12// PY - 1998/12// SE - 39 ER - TY - CHAP TI - Algebraic Algorithms AU - Díaz, Angel AU - Emiris, Ioannis AU - Kaltofen, Erich AU - Pan, Victor T2 - Algorithms and Theory of Computation Handbook PY - 1998/11/23/ DO - 10.1201/9781420049503-c17 OP - PB - CRC Press SN - 9780849326493 9781420049503 UR - http://dx.doi.org/10.1201/9781420049503-c17 DB - Crossref ER - TY - BOOK TI - Intelligent Agents IV Agent Theories, Architectures, and Languages T2 - Lecture Notes in Computer Science A3 - Singh, Munindar P. A3 - Rao, Anand A3 - Wooldridge, Michael J. DA - 1998/// PY - 1998/// DO - 10.1007/bfb0026744 M1 - 1365 PB - Springer SN - 9783540641629 9783540696964 UR - http://dx.doi.org/10.1007/bfb0026744 ER - TY - CHAP TI - Multiagent systems in information-rich environments AU - Huhns, Michael N. AU - Singh, Munindar P. T2 - Cooperative Information Agents II Learning, Mobility and Electronic Commerce for Information Discovery on the Internet AB - Information-rich environments are the open environments that characterize most of the modern applications of computing technology. The applications include ubiquitous information access, electronic commerce, virtual enterprises, logistics, and sensor integration, to name but a few. These applications differ from conventional database applications not only in the nature and variety of information they involve, but also in including a significant component that is beyond the information system per se: the creation, transformation, use, and ultimate fate of information. The environments are typified only by the large amounts and varieties of information they include, and whose effective and efficient management is key to the above applications. Multiagent systems (MAS) are an important paradigm for building complex information systems, especially cooperative ones. We describe how cooperative information system architectures have evolved a set of common types of computational agents. We also describe two approaches that address complementary aspects of MAS construction. PY - 1998/// DO - 10.1007/bfb0053676 SP - 79-93 OP - PB - Springer Berlin Heidelberg SN - 9783540646761 9783540691099 UR - http://dx.doi.org/10.1007/bfb0053676 DB - Crossref ER - TY - CONF TI - FOXBOX AU - Díaz, Angel AU - Kaltofen, Erich T2 - the 1998 international symposium AB - Article Free Access Share on FOXBOX: a system for manipulating symbolic objects in black box representation Authors: Angel Díaz Department of Mathematical Sciences, IBM T. J. Watson Research Center, Yorktown Heights, New York Department of Mathematical Sciences, IBM T. J. Watson Research Center, Yorktown Heights, New YorkView Profile , Erich Kaltofen Department of Mathematics, North Carolina State University, Raleigh, North Carolina Department of Mathematics, North Carolina State University, Raleigh, North CarolinaView Profile Authors Info & Claims ISSAC '98: Proceedings of the 1998 international symposium on Symbolic and algebraic computationAugust 1998Pages 30–37https://doi.org/10.1145/281508.281538Published:01 August 1998Publication History 23citation377DownloadsMetricsTotal Citations23Total Downloads377Last 12 Months37Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF C2 - 1998/// C3 - Proceedings of the 1998 international symposium on Symbolic and algebraic computation - ISSAC '98 DA - 1998/// DO - 10.1145/281508.281538 PB - ACM Press SN - 1581130023 UR - http://dx.doi.org/10.1145/281508.281538 DB - Crossref ER - TY - CONF TI - Efficient algorithms for computing the nearest polynomial with constrained roots AU - Hitz, Markus A. AU - Kaltofen, Erich T2 - the 1998 international symposium AB - Article Free Access Share on Efficient algorithms for computing the nearest polynomial with constrained roots Authors: Markus A. Hitz Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NYView Profile , Erich Kaltofen Mathematics Department, North Carolina State University, Raleigh, NC Mathematics Department, North Carolina State University, Raleigh, NCView Profile Authors Info & Claims ISSAC '98: Proceedings of the 1998 international symposium on Symbolic and algebraic computationAugust 1998 Pages 236–243https://doi.org/10.1145/281508.281624Online:01 August 1998Publication History 36citation254DownloadsMetricsTotal Citations36Total Downloads254Last 12 Months10Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF C2 - 1998/// C3 - Proceedings of the 1998 international symposium on Symbolic and algebraic computation - ISSAC '98 DA - 1998/// DO - 10.1145/281508.281624 PB - ACM Press SN - 1581130023 UR - http://dx.doi.org/10.1145/281508.281624 DB - Crossref ER - TY - JOUR TI - Workflow agents T2 - IEEE Internet Computing DA - 1998/// PY - 1998/// UR - https://publons.com/publon/21294538/ ER - TY - JOUR TI - Workflow agents AU - Huhns, M.N. AU - Singh, M.P. T2 - IEEE Internet Computing AB - Software agents as user agents, resource agents, and brokers may be able to enhance usefulness of workflow applications. Workflow technology is important to network computing because workflows exist naturally wherever distributed resources are interrelated. The problem with current workflow technology is that it is often too rigid. The lack of freedom accorded to human participants causes workflow management systems to appear unfriendly. As a result, they are often ignored or circumvented. This rigidity also causes productivity losses by making it harder to accommodate the flexible, ad hoc reasoning of human intelligence. Another challenge is that system requirements are rarely static. Software agents promise to address these challenges. The roles of greatest interest to a workflow setting are user agents, resource agents, and brokers. When a workflow is constituted in terms of distinct roles that agents can instantiate, the agents can be set up to respect the constraints of their users and resources. User agents negotiate with one another and with resource agents to ensure that global constraints are not violated and that global efficiencies can be achieved. Agents can include functionality to identify different kinds of exception conditions and react appropriately, possibly by negotiating a special sequence of actions. More importantly, agents can learn from repeated instances of the same kinds of exceptions. With this learning ability, agents can process the updated set of constraints when system requirements change. DA - 1998/// PY - 1998/// DO - 10.1109/4236.707813 VL - 2 IS - 4 SP - 94-96 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0345046978&partnerID=MN8TOARS ER - TY - JOUR TI - Developing formal specifications to coordinate heterogeneous autonomous agents T2 - International Conference on Multi-agent Systems, Proceedings AB - We have been developing an approach for the distributed coordination of heterogeneous, autonomous agents. This approach takes as input (a) agent skeletons, giving compact descriptions of the given agents in terms of their events that are significant for coordination, as well as (b) relationships among the events occurring in these skeletons. A natural question is how may the skeletons and relationships be produced in the first place. Parunak (1996) proposed a methodology for designing multiagent systems based on Dooley graphs (1976) from discourse analysis. We show how with a few key modifications, Dooley graphs can also be used to generate the skeletons and relationships required for coordination. This combines the benefits of an intuitive methodology with a formal and distributed framework for developing multiagent systems from autonomous agents. DA - 1998/// PY - 1998/// DO - 10.1109/ICMAS.1998.699063 UR - https://publons.com/publon/21294534/ ER - TY - JOUR TI - The intentions of teams: Team structure, endodeixis, and exodeixis T2 - ECAI 1998: 13TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS DA - 1998/// PY - 1998/// UR - https://publons.com/publon/21294546/ ER - TY - JOUR TI - Intelligent Agents IV - Agent Theories, Architectures, and Languages - 4th International Workshop, ATAL'97, Providence, Rhode Island, USA, July 24-26, 1997 - Proceedings - Introduction T2 - Lecture Notes in Computer Science DA - 1998/// PY - 1998/// UR - https://publons.com/publon/21294544/ ER - TY - JOUR TI - Personal assistants AU - Huhns, M.N. AU - Singh, M.P. T2 - IEEE Internet Computing AB - Already there are simple personal agents to help with some of our shopping. There are agents to track stocks in our portfolios, advise us on how to use particular software products, and arrange meetings within corporate workgroups. However, none of these agents takes more than one aspect of our activities into account, nor do they adapt easily to our preferences. Personal assistants, on the other hand, are agents that can represent individuals on the Web. They help users in their day-to-day activities, especially those involving information retrieval, negotiation, or coordination. A personal assistant might schedule a meeting and then, based on the meeting location, find the nearest babysitting service or the ATM with the lowest transaction fee. The paper discusses the interaction framework, negotiation, profiles and standards. DA - 1998/// PY - 1998/// DO - 10.1109/4236.722236 VL - 2 IS - 5 SP - 90-92 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-2442709095&partnerID=MN8TOARS ER - TY - JOUR TI - Agent information contracts within virtual private networks T2 - Third Ieee International High-assurance Systems Engineering Symposium, Proceedings AB - Virtual enterprises are being built on an Internet backbone, for which security provisioning is an obvious first concern. However, additional services need provisioning as well. For instance, contracted arrangements for quality inspection, notification of delay, and other such coordinations can be provided by semi-autonomous agent-based services. We introduce information contracts, which specify the commitments of ContractAgents to each other. Based on human-readable contract templates with fill-in-the-black terms, ContractAgents manage the negotiation stage between user specialists and then operationalize and ensure these commitments during enactment. Building on the idea of an agent-based sphere of commitments (SoComs) to overcome weaknesses in extended transaction processing and traditional workflow management, we show how ContractAgents also need to be positioned within the security architecture of virtual private networks. The standardization of contracts, SoCom servers, and operationalized commitments can then provide a basis for compliance checks by trusted third parties and oversight authorities. DA - 1998/// PY - 1998/// DO - 10.1109/HASE.1998.731634 UR - https://publons.com/publon/21294543/ ER - TY - JOUR TI - A customizable coordination service for autonomous agents T2 - Lecture Notes in Computer Science AB - We address the problem of constructing multiagent systems by coordinating autonomous agents, whose internal designs may not be fully known. We develop a customizable coordination service that (a) takes declarative specifications of the desired interactions, and (b) automatically enacts them. Our approach is based on temporal logic, and has a rigorous semantics and a naturally distributed implementation. DA - 1998/// PY - 1998/// DO - 10.1007/BFB0026752 UR - https://publons.com/publon/21294545/ ER - TY - JOUR TI - Anthropoid agents AU - Huhns, M.N. AU - Singh, M.P. T2 - IEEE Internet Computing AB - In the study of agents on the Internet, we often ascribe to them human qualities, such as beliefs and intentions. These qualities are best understood as metaphors that give developers a way to talk about and design the capabilities and applications of agents. Despite all the progress in computing, users have been slow to accept the technology. They have often accepted what was thrown at them, but only under economic duress. Bringing the technology closer to their emotional needs might ease this resistance. So how can we put a human face on computing? Maybe by putting an animated face on it! Thus, an interface may consist of an agent, which has an explicit presence (for example, as an on-screen animated figure) and appears to have a personality. In computer human interfaces, especially for education and commerce where a large variety of people must deal with computers, an anthropoid agent might be more inviting. Depending on the situation, the agent might appear shy, friendly, stern, or knowledgeable. For example, people might better accept advice offered politely by a shy agent, or heed warnings uttered seriously by a stern agent. And they might be more likely to purchase goods or services offered by a friendly, knowledgeable agent that could appear empathetic to their needs. DA - 1998/// PY - 1998/// DO - 10.1109/4236.656099 VL - 2 IS - 1 SP - 94-95 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0011365415&partnerID=MN8TOARS ER - TY - CONF TI - Computer architecture course database AU - Gehringer, Edward F. AU - Goulart, Ana E. AU - Sang, Xiaokang AU - Geng, Chenhao T2 - the 1998 workshop AB - A database of course materials in computer architecture is being developed on the World-Wide Web. Its goal is to allow instructors at different institutions to share materials and develop them jointly. This database comprises problems downloaded from the Web sites of courses in computer architecture at universities around the world. The site is searchable by classification or fulltext string for problems on particular topics in computer architecture. At this writing, the database contains 240 problems, and new problems are being added at a rapid pace. In the future, lecture notes and laboratory exercises will also be included. The software is adaptable to other academic fields as well. C2 - 1998/// C3 - Proceedings of the 1998 workshop on Computer architecture education - WCAE '98 DA - 1998/// DO - 10.1145/1275182.1275210 PB - ACM Press SN - 9781450347365 UR - http://dx.doi.org/10.1145/1275182.1275210 DB - Crossref ER - TY - CONF TI - Population pharmacokinetics in veterinary medicine. Introduction and overview AU - Riviere, J. AU - Martin-Jimenez, T. C2 - 1998/// C3 - Proc. 11th Biennial Symp. Am. Acad. Vet. Pharmacol. Therapeutics DA - 1998/// SP - 66-69 ER - TY - JOUR TI - On the semantics of the perfective aspect AU - Singh, M. T2 - Natural Language Semantics DA - 1998/// PY - 1998/// VL - 6 IS - 2 SP - 171-199 ER - TY - JOUR TI - The connectivity of acyclic orientation graphs AU - Savage, CD AU - Zhang, CQ T2 - DISCRETE MATHEMATICS AB - The acyclic orientation graph, AO(G), of an undirected graph, G, is the graph whose vertices are the acyclic orientations of G and whose edges are the pairs of orientations differing only by the reversal of one edge. Edelman (1984) has observed that it follows from results on polytopes that when G is simple, the connectivity of AO(G) is at least n − c, where n is the number of vertices and c is the number of components of G. In this paper we give a simple graph-theoretic proof of this fact. Our proof uses a result of independent interest. We establish that if H is a triangle-free graph with minimum degree at least k, and the graph obtained by contracting the edges of a matching in H is k-connected, then H is k-connected. The connectivity bound on AO(G) is tight for various graphs including Kn, Kp,q, and trees. Applications and extensions are discussed, as well as the connection with polytopes. DA - 1998/4/6/ PY - 1998/4/6/ DO - 10.1016/S0012-365X(97)00201-X VL - 184 IS - 1-3 SP - 281-287 SN - 0012-365X ER - TY - JOUR TI - Durfee polynomials AU - Canfield, E. R. AU - Corteel, S. AU - Savage, C. D. T2 - Electronic Journal of Combinatorics DA - 1998/// PY - 1998/// VL - 5 IS - 1, Research paper 32 SP - 1-21 ER - TY - JOUR TI - Synchronizable test sequences of finite state machines AU - Tai, KC AU - Young, YC T2 - COMPUTER NETWORKS AND ISDN SYSTEMS AB - The finite state machine (FSM) model is commonly used for specifying communication protocols and other types of distributed systems. For an FSM with multiple ports, multiple testers are needed, but the synchronization between inputs from different testers becomes a problem. A synchronizable test sequence of an FSM is a test sequence for which the synchronization problem either does not exist or can be solved by communication between testers. In this paper, we consider two testing strategies for an FSM: port-based testing, which does not allow testers for the FSM to communicate with each other, and group-based testing, which divides ports of the FSM into mutually disjoint groups and allows testers for ports in the same group to communicate with each other. For each type of testing, we define a necessary and sufficient condition under which a test sequence of an FSM is synchronizable and show how to generate a set of testers according to a given test sequence. We also discuss test sequence generation and fault detection, and present the results of empirical studies. DA - 1998/7/13/ PY - 1998/7/13/ DO - 10.1016/S0169-7552(98)00013-0 VL - 30 IS - 12 SP - 1111-1134 SN - 0169-7552 KW - finite state machines KW - communication protocols KW - test sequence generation KW - synchronizable test sequences ER - TY - JOUR TI - Primer on estimating withdrawal times after extralabel drug use AU - Riviere, J. E. AU - Webb, A. I. AU - Craigmill, A. L. T2 - Journal of the American Veterinary Medical Association DA - 1998/// PY - 1998/// VL - 213 IS - 7 SP - 966-968 ER - TY - JOUR TI - Logical observable entities AU - Rossie, JG T2 - ACM SIGPLAN NOTICES AB - We show how finite-state machines can standardize the protocol used by a component object to notify other interested objects of its state changes, resulting in a more effective use of static types to constrain both parties, and a more efficient dissemination of information. The enhanced component specification is called a logical observable entity , or LOE. We address two key issues in effectively applying such a strategy: how to extend subtyping to consider the state machines, and how to ensure some kind of compliance between the state-machine specification and its implementation. This leads to an unusual subtyping predicate for LOEs on the one hand, and a prototype code generation strategy on the other. DA - 1998/10// PY - 1998/10// DO - 10.1145/286942.286954 VL - 33 IS - 10 SP - 154-165 SN - 0362-1340 ER - TY - JOUR TI - Parasitic resistance considerations of using elevated source/drain technology for deep submicron metal oxide semiconductor field effect transistors AU - Sun, J AU - Bartholomew, RF AU - Bellur, K AU - Srivastava, A AU - Osburn, CM AU - Masnari, NA AU - Westhoff, R T2 - JOURNAL OF THE ELECTROCHEMICAL SOCIETY AB - Device drive current, parasitic resistance, and junction leakage current have been studied using silicided and non‐silicided deep submicron elevated source/drain (ESD) n‐channel metal oxide semiconductor field effect transistors (NMOSFETs). This study illustrated the effects of doping profile in the elevated S/D region, junction depth in the substrate, and doping level in the source/drain extension. Compared to devices having nonelevated junctions with the same substrate doping profile, MOSFETs with a profile‐doped elevated S/D, used to contact an ultrashallow junction formed before selective epitaxial growth, had higher drive currents and demonstrated the ability of the elevated junction to reduce the extrinsic resistance. Measurements of drive currents in ESD devices showed that (i) the lightly doped region at the bottom of a profile‐doped elevated layer introduces additional extrinsic resistance, and (ii) the locally deeper junction beneath the epi facets extends laterally toward the channel and shortens the drain extension length, thereby reducing the intrinsic resistance. Silicided devices had higher drive current and reduced parasitic resistance when the silicide/silicon interfacial dopant concentrations remained high (>1 × 1020/cm3) after silicidation. The lowest total parasitic resistance was achieved when the elevated S/D was used to give a small contact resistance to a shallow junction and a moderately doped drain extension was used to lower the resistance of the source/drain extension tab. DA - 1998/6// PY - 1998/6// DO - 10.1149/1.1838607 VL - 145 IS - 6 SP - 2131-2137 SN - 1945-7111 ER - TY - CONF TI - Prototype decision support tool for developing tropospheric ozone control strategies AU - Loughlin, D. AU - Ranjithan, S. AU - Brill, E. D. AU - Baugh, J. AU - Fine, S. C2 - 1998/// C3 - Water resources and the urban environment-98: Proceedings of the 1998 National Conference on Environmental Engineering. ASCE Joint 25th Annual Conference on Water Resources Planning and Management and 1998 National Conference on Environmental Engineering, Chicago, IL, June 7-10,1998 CN - TD201 .N28 1998 DA - 1998/// PB - Reston, VA: American Society of Civil Engineers ER - TY - CHAP TI - Design and verification of real-time systems AU - Baugh, J. W. T2 - Artificial intelligence in structural engineering: Information technology for design, collaboration, maintenance, and monitoring AB - Advances in sensing, effecting, and computational technologies will change the way we design, construct, and monitor systems that interact with the physical world. Building structures will sense and respond to external loads, autonomous robots will occupy construction sites, and intelligent vehicles will monitor network flows to circumvent delays. As engineers, we must be prepared to work with the information technologies that underpin these coming systems. This paper addresses several of the prominent technical concerns in designing real-time systems that control some aspect of their environment. The view taken is that, by considering software systems to be an engineering artifact, we can begin to develop the kinds of quantitative approaches found in other areas of engineering design. CN - TA636 .A77 1998 PY - 1998/// DO - 10.1007/bfb0030441 VL - 1454 SP - 30-47 PB - Berlin; New York: Springer SN - 3540648062 ER - TY - CONF TI - A Web-based computing environment for structural analysis and design AU - Baugh, J. W., Jr. C2 - 1998/// C3 - Structural engineering world wide 1998: Proceedings of the Structural Engineers World Congress, July 19-23, 1998, San Francisco, California CN - TA633 .S88 1998 DA - 1998/// VL - 1 SP - T140-1 ER - TY - JOUR TI - Simulation of a vertical reactor for high pressure organometallic chemical vapor deposition AU - Kepler, GM AU - Hopfner, C AU - Scroggs, JS AU - Bachmann, KJ T2 - MATERIALS SCIENCE AND ENGINEERING B-SOLID STATE MATERIALS FOR ADVANCED TECHNOLOGY AB - The suitability of a vertical cylindrical reactor with highly constrained radial flow from a central gas injection port past a set of heated substrate wafers that are embedded in the top channel wall has been evaluated in the context of organometallic chemical vapor deposition (OMCVD) at elevated pressure. Numerical simulations showed that, in addition to the limitation on the channel height necessary for preventing buoyancy driven recirculation, negotiating the ninety-degree bend at the inlet is problematic and also constrains the channel height below a critical value, at which the radial flow area after the inlet bend is equal to the cross-sectional area of the central gas injection port. Restricting the channel height poses the danger of heating of the channel wall opposite to the substrate wafers causing potential problems with deposition of decomposition products and competitive polycrystalline film growth at this location. These problems can be avoided by actively cooling the channel wall opposite to the substrate and by keeping the retention time of the source vapor molecules and fragments thereof in the wafer location below a critical value. DA - 1998/12/4/ PY - 1998/12/4/ DO - 10.1016/s0921-5107(98)00256-6 VL - 57 IS - 1 SP - 9-17 SN - 0921-5107 KW - organometallic chemical vapor deposition KW - above-atmosphere pressure KW - numerical simulation KW - vertical reactor KW - compressible flow ER - TY - BOOK TI - Mama's book: A story told by Mae Elizabeth Featherstone Winstead, compiled from her writings and notes AU - Winstead, N. N. CN - HQ1438.N8 W56 1998 DA - 1998/// PY - 1998/// PB - Raleigh, NC: N.N. Winstead ER - TY - CONF TI - Congestion control in the wormhole-routed torus with clustering and delayed deflection AU - Hyatt, C. AU - Agrawal, D. P. C2 - 1998/// C3 - Parallel computer routing and communication: Second international workshop, PCRCW 1997, Atlanta, Georgia, USA, June 26-27, 1997. Proceedings. Ed. by Sudhakar Yalamanchili and Jose Duato CN - QA76.58 .P39 1997 DA - 1998/// VL - 1417 SP - 33-38 PB - New York: Springer ER - TY - BOOK TI - An introduction to language (6th ed.) AU - Rodman, R. D. AU - Fromkin, V. CN - P106 .F75 1998 DA - 1998/// PY - 1998/// PB - Fort Worth: Harcourt Brace Jovanovich College Publishers SN - 003018682X ER - TY - CHAP TI - Visual emotive communication in lifelike pedagogical agents AU - Towns, S. G. AU - Fitzgerald, P. J. AU - Lester, J. C. T2 - Intelligent tutoring systems: 4th International Conference, ITS '98, San Antonio, Texas, USA, August 16-19, 1998: Proceedings AB - Lifelike animated agents for knowledge-based learning environments can provide timely, customized advice to support leaners’ problem-solving activities. By drawing on a rich repertoire of emotive behaviors to exhibit contextually appropriate facial expressions and emotive gestures, these agents could exploit the visual channel to more effectively communicate with learners. To address these issues, this paper proposes the emotive-kinesthetic behavior sequencing framework for dynamically sequencing lifelike pedagogical agents’ full-body emotive expression. By exploiting a rich behavior space populated with emotive behaviors and structured by pedagogical speech act categories, a behavior sequencing engine operates in realtime to select and assemble contextually appropriate expressive behaviors. This framework has been implemented in a lifelike pedagogical agent, Cosmo, who exhibits full-body emotive behaviors in response to learners’ problem-solving activities. CN - LB1028.73 .I58 1998 PY - 1998/// DO - 10.1007/3-540-68716-5_53 SP - 474-483 PB - Berlin: Springer ER - TY - CHAP TI - Habitable 3D learning environments for situated learning AU - Bares, W. H. AU - Zettlemoyer, L. S. AU - Lester, J. C. T2 - Intelligent tutoring systems: 4th International Conference, ITS '98, San Antonio, Texas, USA, August 16-19, 1998: Proceedings AB - The growing emphasis on learner-centered education focuses on intrinsically motivated learning via engaging problem-solving activities. Habitable 3D learning environments, in which learners guide avatars through virtual worlds for role-based problem solving, hold great promise for situated learning. We have been investigating habitable learning environments by iteratively designing, implementing, and evaluating them. In the Situated Avatar-Based Immersive Learning (SAIL) framework for habitable 3D learning environments, learners navigate avatars through virtual worlds as they solve problems by manipulating artifacts. The SAIL framework has been used to implement CPU CITY, a 3D learning environment testbed for the domain of computer architecture. A visually compelling virtual cityscape of computer components, CPU CITY presents learners with goal advertisements that focus their attention on salient problem-solving sub-tasks. The CPU CITY testbed has produced prototypes that have been evaluated. Pilot studies suggest that habitable learning environments offer a promising new paradigm for educational applications. CN - LB1028.73 .I58 1998 PY - 1998/// DO - 10.1007/3-540-68716-5_13 SP - 76-85 PB - Berlin: Springer ER - TY - JOUR TI - pH-gated single-electron tunneling in chemically modified gold nanoclusters AU - Brousseau, LC AU - Zhao, Q AU - Shultz, DA AU - Feldheim, DL T2 - JOURNAL OF THE AMERICAN CHEMICAL SOCIETY AB - ADVERTISEMENT RETURN TO ISSUEPREVCommunicationNEXTpH-Gated Single-Electron Tunneling in Chemically Modified Gold NanoclustersLouis C. Brousseau, Qi Zhao, David A. Shultz, and Daniel L. FeldheimView Author Information Department of Chemistry, North Carolina State University Raleigh, North Carolina 27695 Cite this: J. Am. Chem. Soc. 1998, 120, 30, 7645–7646Publication Date (Web):July 21, 1998Publication History Received15 April 1998Published online21 July 1998Published inissue 1 August 1998https://doi.org/10.1021/ja981262sCopyright © 1998 American Chemical SocietyRIGHTS & PERMISSIONSArticle Views361Altmetric-Citations75LEARN ABOUT THESE METRICSArticle Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to reflect usage leading up to the last few days.Citations are the number of other articles citing this article, calculated by Crossref and updated daily. Find more information about Crossref citation counts.The Altmetric Attention Score is a quantitative measure of the attention that a research article has received online. Clicking on the donut icon will load a page at altmetric.com with additional details about the score and the social media presence for the given article. Find more information on the Altmetric Attention Score and how the score is calculated. Share Add toView InAdd Full Text with ReferenceAdd Description ExportRISCitationCitation and abstractCitation and referencesMore Options Share onFacebookTwitterWechatLinked InReddit Read OnlinePDF (42 KB) Get e-AlertscloseSupporting Info (1)»Supporting Information Supporting Information SUBJECTS:Cluster chemistry,Electrical properties,Gold,Nanoclusters,Nanoparticles Get e-Alerts DA - 1998/8/5/ PY - 1998/8/5/ DO - 10.1021/ja981262s VL - 120 IS - 30 SP - 7645-7646 SN - 0002-7863 ER - TY - JOUR TI - Transcriptional activation of the ovine follicle-stimulating hormone beta-subunit gene by gonadotropin-releasing hormone: Involvement of two activating protein-1-binding sites and protein kinase C AU - Strahl, BD AU - Huang, HJ AU - Sebastian, J AU - Ghosh, BR AU - Miller, WL T2 - ENDOCRINOLOGY DA - 1998/11// PY - 1998/11// DO - 10.1210/en.139.11.4455 VL - 139 IS - 11 SP - 4455-4465 SN - 1945-7170 ER - TY - JOUR TI - The effect of dipolar interactions on the liquid crystalline phase transitions of hard spherocylinders with central longitudinal dipoles AU - McGrother, SC AU - Gil-Villegas, A AU - Jackson, G T2 - MOLECULAR PHYSICS AB - Abstract The results of isothermal—isobaric Monte Carlo (MC-NPT) simulations for N = 1020 hard spherocylinders of aspect ratio L/D = 5 with embedded central longitudinal point dipoles are presented. The effect of the dipolar interactions on the phase transitions to the mesophases is examined. For this aspect ratio, non-polar hard spherocylinders exhibit both nematic (N) and smectic-A (SmA) liquid crystalline phases. This study examines the effect of the dipoles on the densities and pressures of the transitions from the isotropic (I) fluid to these liquid crystalline phases. The long range of the dipole-dipole interaction is accounted for by using the reaction field approach with a self-consistent treatment of the dielectric of the boundary; this approach gives results indistinguishable from the full Ewald summation, which is very computationally costly. At moderate temperatures, the transition from the isotropic fluid to the nematic liquid crystalline phases appears to be postponed to higher densities by the inclusion of the dipole. This rather surprising result could stem from a reduction in effective aspect ratio of the aggregates as a result of anti-parallel side-by-side dipole pairing. As expected, the smectic-A phase is found to be stabilized with respect to the nematic phase as a consequence of the strong dipolar interactions that are possible within a layer. Indeed, at lower temperatures, the nematic phase vanishes altogether and an I—SmA transition is observed. Therefore the existence of an I-N—SmA triple point is predicted. The occurrence of a re-entrant nematic phase for this system cannot be ruled out. Unlike the non-polar system, the ordering transition exhibits appreciable hysteresis: at low temperatures glassy states are obtained by compressing the isotropic fluid, and a heating and annealing cycle is required to obtain stable smectic-A phases. This means that it is difficult to locate the precise positions of the phase transtions at lower temperatures, and care should be taken in interpreting the results. No evidence of ferroelectric behaviour is found in any of the states examined, even at low temperatures. DA - 1998/10/20/ PY - 1998/10/20/ DO - 10.1080/00268979809483199 VL - 95 IS - 3 SP - 657-673 SN - 1362-3028 ER - TY - JOUR TI - Hyperglobulinemia and lymphocyte subset changes in naturally infected, in apparent carriers of equine infectious anemia virus AU - Russell, K. E. AU - Walker, K. M. AU - Miller, R. T. AU - Sellon, D. C. T2 - American Journal of Veterinary Research DA - 1998/// PY - 1998/// VL - 59 IS - 8 SP - 1009-1015 ER - TY - JOUR TI - Graphical basis partitions AU - Nolan, JM AU - Sivaraman, V AU - Savage, CD AU - Tiwari, PK T2 - GRAPHS AND COMBINATORICS AB - A partition of an integer n is graphical if it is the degree sequence of a simple, undirected graph. It is an open question whether the fraction of partitions of n which are graphical approaches 0 as n approaches infinity. A partition π is basic if the number of dots in its Ferrers graph is minimum among all partitions with the same rank vector as π. In this paper, we investigate graphical partitions via basis partitions. We show how to efficiently count and generate graphical basis partitions and how to use them to count graphical partitions. We give empirical evidence which leads us to conjecture that, as n approaches infinity, the fraction of basis partitions of n which are graphical approaches the same limit as the fraction of all partitions of n which are graphical. DA - 1998/// PY - 1998/// DO - 10.1007/s003730050029 VL - 14 IS - 3 SP - 241-261 SN - 0911-0119 ER - TY - JOUR TI - Statistical properties of fitted estimates of apparent in vivo metabolic constants obtained from gas uptake data. I. Lipophilic and slowly metabolized VOCs AU - Smith, A. E. AU - Evans, M. V. AU - Davidian, M. T2 - Inhalation Toxicology DA - 1998/// PY - 1998/// VL - 10 IS - 5 SP - 383-409 ER - TY - JOUR TI - Speaker independence in automated lip-sync for audio-video communication AU - McAllister, DF AU - Rodman, RD AU - Bitzer, DL AU - Freeman, AS T2 - COMPUTER NETWORKS AND ISDN SYSTEMS AB - By analyzing the absolute value of the Fourier transform of a speaker's voice signal we can predict the position of the mouth for English vowel sounds. This is without the use of text, speech recognition or mechanical or other sensing devices attached to the speaker's mouth. This capability can reduce the time required for mouth animation considerably. We expect it to be competitive eventually with the speech/text driven solutions which are becoming popular. Our technique would require much less interaction from the user and no knowledge of phonetic spelling. We discuss the problems of producing an algorithm that is speaker independent. The goal is to avoid having to measure mouth movements off video for each speaker's training sounds. We have discovered that eliminating variation due to pitch yields moments which are mouth shape dependent but not speaker dependent. This implies that careful construction of predictor surfaces can produce speaker independent prediction of mouth motion for English vowels. DA - 1998/11/12/ PY - 1998/11/12/ DO - 10.1016/S0169-7552(98)00216-5 VL - 30 IS - 20-21 SP - 1975-1980 SN - 0169-7552 KW - facial animation KW - lip synchronization KW - speech processing ER - TY - JOUR TI - Semantical considerations on intention dynamics for BDI agents AU - Singh, MP T2 - JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE AB - The BDI paradigm is a powerful means for constructing intelligent agents in terms of their beliefs, desires, and intentions. For this paradigm to bear its full potential, it must incorporate considerations from rationality. This paper develops a set of postulates for intelligent agents who deliberate about their intentions and actions. However, even simple postulates can lead to paradoxical results when formalized naively. We propose an approach based on temporal possibility and action that avoids those problems. This approach incorporates a formal model based on branching time in which a probabilistic analysis of choice can be captured. In this manner, the intuitions of the BDI paradigm can be reconciled with those of rational agency. DA - 1998/// PY - 1998/// DO - 10.1080/095281398146752 VL - 10 IS - 4 SP - 551-564 SN - 0952-813X UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0032344134&partnerID=MN8TOARS KW - intentions KW - rational agents KW - BDI model KW - BDI architectures ER - TY - JOUR TI - Predicting the capacity of powdered activated carbon for trace organic compounds in natural waters AU - Knappe, DRU AU - Matsui, Y AU - Snoeyink, VL AU - Roche, P AU - Prados, MJ AU - Bourbigot, MM T2 - ENVIRONMENTAL SCIENCE & TECHNOLOGY AB - The purpose of this research was to develop a simple method for predicting the powdered activated carbon (PAC) capacity for micropollutants in natural water. The herbicide atrazine and the odor-causing compound 2-methyl- isoborneol served as target compounds. Isotherm data from experiments conducted with a constant initial adsorbate concentration and varying adsorbent doses exhibited nonlinearity in both single- and multi-solute systems. However, at any given adsorbent dose, the PAC capacity for the micropollutant in multi-solute systems was directly proportional to the initial micropollutant concentration. Using the ideal adsorbed solution theory (IAST), an equation was derived that validated the experimentally observed direct proportionality between PAC capacity and initial micropollutant concentration at a given adsorbent dose. The results of this study show that the PAC dose to remove any amount of micropollutant from natural waters can be estimated without the use of mathematical models from a single isotherm experiment conducted in the natural water of interest, provided that the initial target compound concentration is sufficiently low. DA - 1998/6/1/ PY - 1998/6/1/ DO - 10.1021/es970833y VL - 32 IS - 11 SP - 1694-1698 SN - 0013-936X ER - TY - JOUR TI - Phase coarsening and crack growth rate during thermo-mechanical cycling of 63Sn37Pb solder joints AU - Hacke, PL AU - Fahmy, Y AU - Conrad, H T2 - JOURNAL OF ELECTRONIC MATERIALS DA - 1998/8// PY - 1998/8// DO - 10.1007/s11664-998-0125-0 VL - 27 IS - 8 SP - 941-947 SN - 0361-5235 KW - annealing KW - coarsening KW - fatigue crack growth rate KW - interphase diffusion KW - phase size KW - thermo-mechanical fatigue ER - TY - JOUR TI - On the mean waiting time of a population constrained open tandem queueing network with constant service times AU - Rhee, Y. AU - Perros, H. G. T2 - IIE Transactions AB - We obtain an approximate expression for the mean waiting time of an open tandem queueing network with population constraint, constant service times and an arbitrary arrival process. DA - 1998/// PY - 1998/// DO - 10.1080/07408179808966550 VL - 30 IS - 10 SP - 973-979 ER - TY - JOUR TI - Numerical simulation of the sensitivity of summer monsoon circulation and rainfall over India to land surface processes AU - Raman, S AU - Mohanty, UC AU - Reddy, NC AU - Alapaty, K AU - Madala, RV T2 - PURE AND APPLIED GEOPHYSICS DA - 1998/10// PY - 1998/10// DO - 10.1007/s000240050178 VL - 152 IS - 4 SP - 781-809 SN - 0033-4553 KW - numerical simulation KW - summer monsoon KW - circulation KW - land surface KW - parameterization ER - TY - JOUR TI - Nondestructive determination of tensile properties and fracture toughness of cold worked A36 steel AU - Murty, KL AU - Mathew, MD AU - Wang, Y AU - Shah, VN AU - Haggag, FM T2 - INTERNATIONAL JOURNAL OF PRESSURE VESSELS AND PIPING AB - Tensile and fracture properties of ASTM grade A36 steel have been studied using nondestructive Stress–Strain Microprobe™ system (SSM), which is developed on the basis of automated ball indentation (ABI) technique. Tests have been carried out on as-received, and cold worked (4, 8 and 12%) materials at several temperatures in the range −150°C–+200°C at a constant strain rate. Tensile properties determined from ABI tests agreed well with the results from conventional tensile tests. The elastic–plastic fracture toughness parameter KJC was estimated from the ABI data. As expected, cold working resulted in increase in strength, decrease in fracture toughness and increase in ductile to brittle transition temperature. ABI is a reliable nondestructive technique for determining tensile and fracture properties of materials and has potential applications in the nuclear industry particularly to determine toughness degradation due to aging in service. DA - 1998/9// PY - 1998/9// DO - 10.1016/S0308-0161(98)00093-3 VL - 75 IS - 11 SP - 831-840 SN - 0308-0161 KW - cold worked A36 steel KW - fracture toughness KW - tensile properties KW - ball indentation ER - TY - JOUR TI - Experimental evaluation of intelligent assistance for navigation AU - St Amant, R AU - Long, T AU - Dulberg, MS T2 - KNOWLEDGE-BASED SYSTEMS AB - Modern user interfaces make extensive use of navigation, a metaphor based on wayfinding in a physical space. Navigation can be an effective solution for many problems in understanding and manipulating a complex information space. Unfortunately, current research toward domain-independent, intelligent assistance for navigation lacks some important conceptual and practical tools for evaluation. This article describes an empirical study of assisted navigation that investigates the relationship between the quality of the assistance and overall performance. Our definition of quality is based on the information retrieval concepts of precision and recall. We use the limitations of the study results to motivate the development of a general-purpose navigation testbed. By separating the concerns of retrieving navigational data, maintaining and managing the resulting information space, and providing different views into the space, the testbed facilitates the development of navigational mechanisms and supports their evaluation. The testbed will act as a foundation for future work toward the automated generation of intelligent tools for navigational assistance. DA - 1998/9/30/ PY - 1998/9/30/ DO - 10.1016/S0950-7051(98)00054-9 VL - 11 IS - 1 SP - 61-70 SN - 1872-7409 KW - intelligent assistance KW - navigation KW - evaluation ER - TY - CONF TI - Automated lip-sync animation as a telecommunications aid for the hearing impaired AU - Rodman, R. D. AU - McAllister, D. F. AU - Bitzer, D. L. AU - Freeman, A. S. C2 - 1998/// C3 - Proceedings, 1998 IEEE 4th Workshop Interactive Voice Technology for Telecommunications Applications: IVTTA '98, September 29th-30th, 1998, Turino, Italy CN - TK7882.S65 I39 1998 DA - 1998/// SP - 202-208 PB - New York: Institute of Electrical and Electronics Engineers, Inc.; Piscataway, NJ: IEEE Service Center ER - TY - JOUR TI - Applying the mu-calculus in planning and reasoning about action AU - Singh, MP T2 - JOURNAL OF LOGIC AND COMPUTATION AB - Planning algorithms have traditionally been geared towards achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified set of states. More general approaches for planning based on temporal logic (TL) are emerging. Current approaches tend to use linear TL, and can handle sets of sequences of states. However, they assume deterministic actions with all changes effected solely by one agent. By contrast, we use a branching model of time that can express concurrent actions by multiple agents and the environment, leading to nondeterministic effects of an agent's actions. For this reason, we view plans not as sequences of actions, but as decision graphs describing the agent's actions in different situations. Thus, although we consider single-agent decision graphs, our approach is better suited to multiagent systems. We also consider an expressive formalism, which allows a wider variety of goals, including achievement and maintenance goals. Achievement corresponds to traditional planning, but maintenance is more powerful than traditional maintenance goals, and may require nonterminating plans. To formalize decision graphs requires a means to ‘alternate’ the agent's and the environment's choices. From logics of program, we introduce the prepositional mu-calculus;, which has operators for least and greatest fixpoints. We give a semantics, a fixpoint characterization, and an algorithm to compute decision graphs. DA - 1998/6// PY - 1998/6// DO - 10.1093/logcom/8.3.425 VL - 8 IS - 3 SP - 425-445 SN - 1465-363X UR - https://publons.com/publon/21294536/ KW - mu-calculus KW - planning KW - reasoning about action KW - temporal logic ER - TY - CONF TI - A customizable coordination service for autonomous agents AU - Singh, M. P. A2 - M. P. Singh, A. Rao A2 - Wooldridge, M. J. C2 - 1998/// C3 - Intelligent agents IV: Agent theories, architectures, and languages: 4th International Workshop, ATAL'97, Providence, Rhode Island, USA, July 24-26, 1997: Proceedings CN - QA76.76.I58 A83 1997 DA - 1998/// SP - 93-106 PB - New York: Springer ER - TY - JOUR TI - A bijection for partitions with all ranks at least t AU - Corteel, S AU - Savage, CD AU - Venkatraman, R T2 - JOURNAL OF COMBINATORIAL THEORY SERIES A AB - It follows from the work of Andrews and Bressoud that fort⩽1, the number of partitions ofnwith all successive ranks at leasttis equal to the number of partitions ofnwith no part of size 2−t. We give a simple bijection for this identity which generalizes a result of Cheema and Gordon for 2-rowed plane partitions. The bijection yields several refinements of the identity when the partition counts are parametrized by the number of parts and/or the size of the Durfee rectangle. In addition, it gives an interpretation of the difference of (shifted) successive Gaussian polynomials which we relate to other interpretations of Andrews and Fishel. DA - 1998/8// PY - 1998/8// DO - 10.1006/jcta.1998.2873 VL - 83 IS - 2 SP - 202-220 SN - 0097-3165 ER - TY - JOUR TI - Spectroscopic ellipsometry and low-temperature reflectance: complementary analysis of GaN thin films AU - Edwards, NV AU - Yoo, SD AU - Bremser, MD AU - Horton, MN AU - Perkins, NR AU - Weeks, TW AU - Liu, H AU - Stall, RA AU - Kuech, TF AU - Davis, RF AU - Aspnes, DE T2 - THIN SOLID FILMS AB - Abstract We report spectroscopic ellipsometry (SE) and low-temperature reflectance data on epitaxial GaN thin-film samples covering the widest range of tensile and compressive stress (−3.8 to 3.5 kbar) thus far. SE allows us to assess the preparation of smooth and abrupt GaN surfaces by chemical treatments in real time, and, coupled with the reflectance data, the E d n /d E contribution to dispersion, which is important for laser action. The reflectance data explicitly show the non-linear behavior of the B-A and C-A splittings vs. the energy of the A exciton. Lineshape ambiguities that hindered previous interpretations have been resolved with reciprocal space analysis, allowing us to obtain band parameters such as Δ SO =17.0±1 meV and Δ CF =9.8±1 meV with increased confidence. DA - 1998/2// PY - 1998/2// DO - 10.1016/S0040-6090(97)00815-8 VL - 313 SP - 187-192 SN - 0040-6090 KW - GaN KW - spectroscopic ellipsometry KW - reflectance KW - valence bands KW - excitons KW - reciprocal space analysis ER - TY - CONF TI - Speaker recognition of disguised voices AU - Rodman, R. D. C2 - 1998/// C3 - Proceedings of the COST250 Conference on speaker recognition by man and machine: directions for forensic applications. Ankara, Turkey. April, 1998 DA - 1998/// SP - 9-22 M1 - 1998 ER - TY - JOUR TI - Population pharmacokinetics of gentamicin in horses AU - Martin-Jimenez, T. AU - Papich, M. G. AU - Riviere, J. E. T2 - American Journal of Veterinary Research DA - 1998/// PY - 1998/// VL - 59 IS - 12 SP - 1589-1598 ER - TY - JOUR TI - Outsider art: Contesting boundaries in contemporary culture AU - Garrett, P. T2 - Contemporary Sociology DA - 1998/// PY - 1998/// VL - 27 IS - 6 SP - 615-616 ER - TY - PCOMM TI - On locally invertible rate-1/n convolutional encoders AU - Bitzer, DL AU - Dholakia, A AU - Koorapaty, H AU - Vouk, MA AB - A locally invertible convolutional encoder has a local inverse defined as a full rank w/spl times/w matrix that specifies a one-to-one mapping between equal-length blocks of information and encoded bits. In this correspondence, it is shown that a rate-1/n convolutional encoder is nondegenerate and noncatastrophic if and only if it is locally invertible. Local invertibility is used to obtain upper and lower bounds on the number of consecutive zero-weight branches in a convolutional codeword. Further, existence of a local inverse can be used as an alternate test for noncatastrophicity instead of the usual approach involving computation of the greatest common divisor of n polynomials. DA - 1998/1// PY - 1998/1// DO - 10.1109/18.651074 SP - 420-422 KW - convolutional encoders KW - focally invertible encoders KW - noncatastrophic encoders KW - semi-infinite generator matrix KW - zero-run problem ER - TY - JOUR TI - Lip-lip interactions and the growth of multiwalled carbon nanotubes AU - Nardelli, M. B. AU - Brabec, C. AU - Maiti, A. AU - Roland, C. AU - Bernholc, J. T2 - Physical Review Letters AB - Using a realistic many-body potential, we have simulated the properties of double-walled carbon nanotubes with the aim of investigating the role of lip-lip interactions on nanotube growth. Surprisingly, the lip-lip interaction by itself does not stabilize open-ended growth, but rather facilitates tube closure by mediating the transfer of atoms between inner and outer shells. A simulation of growth on a wide double-wall nanotube leads to considerable deviations from the ideal structure, in contrast to corresponding simulations for single-wall tubes, which result in nearly perfect structures. DA - 1998/// PY - 1998/// DO - 10.1103/physrevlett.80.313 VL - 80 IS - 2 SP - 313-316 ER - TY - JOUR TI - Comparative study of the structural, electronic, and magnetic properties of the layered ternary vanadium oxides CaV4O9, Cs2V4O9, and [H2N(CH2)(4)NH2]V4O9 AU - Zhang, YP AU - Warren, CJ AU - Haushalter, RC AU - Clearfield, A AU - Seo, DK AU - Whangbo, MH T2 - CHEMISTRY OF MATERIALS AB - We report the preparation, single-crystal X-ray structure determination, and magnetic susceptibility measurements of a new ternary vanadium oxide, [H2N(CH2)4NH2]V4O9. This compound has isolated V4O92- layers made up of edge-sharing VO5 square pyramids. The V4O92- layers of [H2N(CH2)4NH2]V4O9 ([H2N(CH2)4NH2] = piperidinium) differ from those of two other ternary vanadium oxides, CaV4O9 and A2V4O9 (A = Rb, Cs), in the way the VO5 square pyramids are shared, and the magnetic susceptibilities of the three oxides are widely different in their maximum susceptibility values and the temperatures where these values occur. To explain these observations, the electronic structures of the three oxides were analyzed based on molecular orbital calculations. DA - 1998/4// PY - 1998/4// DO - 10.1021/cm970653n VL - 10 IS - 4 SP - 1059-1064 SN - 0897-4756 ER - TY - JOUR TI - Use of sequencing constraints for specification-based testing of concurrent programs AU - Carver, RH AU - Tai, KC T2 - IEEE TRANSACTIONS ON SOFTWARE ENGINEERING AB - This paper presents and evaluates a specification-based methodology for testing concurrent programs. This methodology requires sequencing constraints, which specify restrictions on the allowed sequences of synchronization events. Sequencing constraints for a concurrent program can be derived from the program's formal or informal specification. Details of the proposed testing methodology based on the use of Constraints on Succeeding and Preceding Events (CSPE) are given. How to achieve coverage and detect violations of CSPE constraints for a concurrent program, according to deterministic and nondeterministic testing of this program, are described. A coverage criterion for CSPE-based testing is defined and analyzed. The results of empirical studies of CSPE-based testing for four concurrent problems are reported. These results indicate that the use of sequencing constraints for specification-based testing of concurrent programs is a promising approach. DA - 1998/6// PY - 1998/6// DO - 10.1109/32.689403 VL - 24 IS - 6 SP - 471-490 SN - 0098-5589 KW - software testing KW - specification-based testing KW - concurrent programs KW - sequencing constraints ER - TY - JOUR TI - Synthesis and characterization of tetrachlorodiarylethyne-linked porphyrin dimers. Effects of linker architecture on intradimer electronic communication AU - Strachan, JP AU - Gentemann, S AU - Seth, J AU - Kalsbeck, WA AU - Lindsey, JS AU - Holten, D AU - Bocian, DF T2 - INORGANIC CHEMISTRY AB - The effects of incorporating chloro groups at all ortho positions of a diphenylethyne linker that bridges the zinc and free base (Fb) components of a porphyrin dimer (ZnFbB(Cl4)) have been investigated in detail via various static and time-resolved spectroscopic methods. The excited-state energy-transfer rate in ZnFbB(Cl4) ((134 ps)-1) is 5-fold slower than that in the corresponding dimer having an unsubstituted linker (ZnFbU, (24 ps)-1) but is only modestly slower than that in the dimer having o-methyl groups on the linker (ZnFbB(CH3)4, (115 ps)-1). The ground-state hole/electron-hopping rates in the oxidized bis-Zn analogues of all three dimers are much slower than the excited-state energy-transfer rates. There is no discernible difference between the hole/electron-hopping rates in the o-chloro- and o-methyl-substituted arrays. The similar ground- and excited-state dynamics observed for the o-chloro- and o-methyl-substituted arrays is attributed to the dominance of torsional constraints in mediating the extent of through-bond electronic communication. These constraints attenuate intradimer communication by restricting the rotation toward coplanarity of the phenyl rings of the linker and the porphyrin rings. Thus, the o-chloro groups on the linker decrease electronic communication via a steric, rather than purely electronic, mechanism. DA - 1998/3/23/ PY - 1998/3/23/ DO - 10.1021/ic970967c VL - 37 IS - 6 SP - 1191-1201 SN - 0020-1669 ER - TY - JOUR TI - Performance analysis of a photonic single-hop ATM switch architecture, with tunable transmitters and fixed frequency receivers AU - McKinnon, MW AU - Rouskas, GN AU - Perros, HG T2 - PERFORMANCE EVALUATION AB - We consider a photonic asynchronous transfer mode (ATM) switch based on the single-hop wavelength division multiplexing (WDM) architecture with tunable transmitters and fixed frequency receivers. The switch operates under a schedule that masks the transceiver tuning latency. We analyze approximately a queueing model of the switch in order to obtain the queue-length distribution and the cell-loss probability at the input and output ports. The analysis is carried out assuming two-state Markov modulated Bernoulli process (MMBP) sources that capture the notion of burstiness and correlation, two important characteristics of ATM traffic, and non-uniform destination probabilities. We present results which establish that the performance of the switch is a complex function of a number of system parameters, including the load balancing and scheduling algorithms, the number of available channels, and the buffer capacity. We also show that the behavior of the switch in terms of cell-loss probability as these parameters are varied cannot be predicted without an accurate analysis. Our work makes it possible to study the interactions among the system parameters, and to predict, explain, and fine tune the performance of the switch. DA - 1998/7// PY - 1998/7// DO - 10.1016/S0166-5316(98)00003-0 VL - 33 IS - 2 SP - 113-136 SN - 1872-745X KW - optical networks KW - photonic ATM switch architecture KW - Markov modulated Bernoulli process (MMBP) KW - wavelength division multiplexing (WDM) KW - discrete-time queueing networks ER - TY - JOUR TI - Electrophonon resonance in cylindrical quantum wires AU - Yu, SG AU - Pevzner, VB AU - Kim, KW AU - Stroscio, MA T2 - PHYSICAL REVIEW B DA - 1998/8/15/ PY - 1998/8/15/ DO - 10.1103/physrevb.58.3580 VL - 58 IS - 7 SP - 3580-3583 SN - 1550-235X ER - TY - JOUR TI - Coulomb drag in the ballistic electron transport regime AU - Gurevich, VL AU - Pevzner, VB AU - Fenton, EW T2 - JOURNAL OF PHYSICS-CONDENSED MATTER AB - We calculate the Coulomb drag current created in the ballistic transport regime in a one-dimensional nanowire by a ballistic current in a nearby nanowire. We predict sharp oscillations of the drag current as a function of the gate voltage or chemical potential. Our results may be of relevance to the issue of the cross-wire talk which is of pivotal importance to the proper operation of scaled-down devices and VLSI circuits. DA - 1998/3/23/ PY - 1998/3/23/ DO - 10.1088/0953-8984/10/11/018 VL - 10 IS - 11 SP - 2551-2558 SN - 0953-8984 ER - TY - JOUR TI - Basis partitions AU - Nolan, JM AU - Savage, CD AU - Wilf, HS T2 - DISCRETE MATHEMATICS AB - We study basis partitions , introduced by Hansraj Gupta in 1978. For this family of partitions, we give a recurrence, a generating function, identities relating basis partitions to more familiar families of partitions, and a new characterization of basis partitions. DA - 1998/1/15/ PY - 1998/1/15/ DO - 10.1016/S0012-365X(97)00101-5 VL - 179 IS - 1-3 SP - 277-283 SN - 0012-365X ER - TY - JOUR TI - An investigation of the deformation mechanisms in Sn5%Sb alloy using tensile, creep and ABI tests from ambient to 473K AU - Murty, KL AU - Mathew, MD AU - Haggag, FM T2 - METALS AND MATERIALS-KOREA DA - 1998/// PY - 1998/// DO - 10.1007/bf03026401 VL - 4 IS - 4 SP - 799-802 SN - 1225-9438 KW - ABI KW - Sn5%Sb KW - creep KW - activation energy KW - deformation mechanism ER - TY - JOUR TI - Toward a model theory of actions: How agents do it in branching time AU - Singh, MP T2 - COMPUTATIONAL INTELLIGENCE AB - A clear understanding and formalization of actions is essential to computing, and especially so to reasoning about and constructing intelligent agents. Several approaches have been proposed over the years. However, most approaches concentrate on the causes and effects of actions, but do not give general characterizations of actions themselves. A useful formalization of actions would be based on a general, possibly nondiscrete, model of time that allows branching (to capture agents’ choices). A desirable formalization would also allow actions to be of arbitrary duration and would permit multiple agents to act concurrently. We develop a branching‐time framework that allows great flexibility in how time and action are modeled. We motivate and formalize several coherence constraints on our models, which capture some nice intuitions and validate some useful inferences relating actions with time. DA - 1998/8// PY - 1998/8// DO - 10.1111/0824-7935.00064 VL - 14 IS - 3 SP - 287-317 SN - 0824-7935 UR - https://publons.com/publon/21294532/ KW - actions KW - time KW - formal models KW - branching-time temporal logics ER - TY - JOUR TI - Theory of growth and mechanical properties of nanotubes AU - Bernholc, J AU - Brabec, C AU - Nardelli, MB AU - Maiti, A AU - Roland, C AU - Yakobson, BI T2 - APPLIED PHYSICS A-MATERIALS SCIENCE & PROCESSING DA - 1998/7// PY - 1998/7// DO - 10.1007/s003390050735 VL - 67 IS - 1 SP - 39-46 SN - 1432-0630 ER - TY - JOUR TI - Rank modifications of semidefinite matrices associated with a secant update formula AU - Chu, MT AU - Funderlic, RE AU - Golub, GH T2 - SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS AB - This paper analyzes rank modification of symmetric positive definite matrices H of the form H- M+ P, where H- M denotes a step of reducing H to a lower-rank, symmetric and positive semidefinite matrix and ( H- M)+ P denotes a step of restoring H- M to a symmetric positive definite matrix. These steps and their generalizations for rectangular matrices are fully characterized. The well-known BFGS and DFP updates used in Hessian and inverse Hessian approximations provided the motivation for the generalizations and are special cases with H and P having rank one. DA - 1998/10/30/ PY - 1998/10/30/ DO - 10.1137/S0895479896306021 VL - 20 IS - 2 SP - 428-436 SN - 0895-4798 KW - rank-one reduction KW - Wedderburn theorem KW - BFGS update KW - DFP update KW - quasi-Newton methods KW - rank subtractivity KW - rank additivity ER - TY - JOUR TI - Mesoscale analysis of a Carolina coastal front AU - Raman, S AU - Reddy, NC AU - Niyogi, DS T2 - BOUNDARY-LAYER METEOROLOGY DA - 1998/1// PY - 1998/1// DO - 10.1023/A:1000605030775 VL - 86 IS - 1 SP - 125-145 SN - 0006-8314 KW - GALE KW - coastal front KW - atmospheric boundary layer KW - Gulf Stream KW - mesoscale analysis KW - North Carolina ER - TY - JOUR TI - Inheritance and QTL analysis of field resistance to ashy stem blight in common bean AU - Miklas, PN AU - Stone, V AU - Urrea, CA AU - Johnson, E AU - Beaver, JS T2 - CROP SCIENCE AB - Ashy stem blight [caused by Macrophomina phaseolina (Tassi) Goid.] can be a serious disease of common bean ( Phaseolus vulgaris L.) under drought and high temperature conditions in some regions. The mode of inheritance of valuable sources of resistance is lacking. We studied inheritance of field resistance to ashy stem blight in a recombinant inbred population (‘Dorado’ × XAN 176) consisting of 119 F S:7 recombinant inbred lines (RILs) tested in replicated experiments across 2 yr. A score from 1 to 9 (no disease to severe disease) was used to measure disease reaction. Moderate HNs (0.53 and 0.57) and near‐normal frequency distribution of RILs for mean disease score each year indicated a lack of discrete segregation classes. The phenotypic variation across a subgroup composed of 79 RILs was further investigated with 165 randomly amplified polymorphic DNA (RAPD) markers by one‐way analyses of variance and interval mapping. Five quantitative trait loci (QTL), explaining 19, 15, 15, 13, and 13% of the phenotypic variation for disease score, were detected in 1993. Three of these QTL, explaining 15,12, and 12% of the variation in disease reaction, were detected in 1994. Multiple QTL regression models ( P < 0.01) explained up to 47% (four loci) of the phenotypic variation for disease score in 1993 and 28% (three loci) in 1994. The five QTL, all derived from XAN 176, generally showed additive effects. These QTL‐linked RAPD markers may prove useful for indirect selection of field resistance to ashy stem blight derived from XAN 176. DA - 1998/// PY - 1998/// DO - 10.2135/cropsci1998.0011183X003800040004x VL - 38 IS - 4 SP - 916-921 SN - 1435-0653 ER - TY - JOUR TI - Improved ratcheting analysis of piping components AU - Hassan, T AU - Zhu, Y AU - Matzen, VC T2 - INTERNATIONAL JOURNAL OF PRESSURE VESSELS AND PIPING AB - It is well known that ratcheting (defined as the accumulation of deformation with cycles) can reduce fatigue life or cause failure of piping components or systems subjected to seismic or other cyclic loads. This phenomenon is sometime referred to as fatigue-ratcheting, which is yet to be understood clearly. Commercial finite element codes cannot accurately simulate the ratcheting responses recorded in tests on piping components or systems. One of the reasons for this deficiency has been traced to inadequate constitutive models in the existing analysis codes. To overcome this deficiency, an improved cyclic plasticity model, composed of the Armstrong–Frederick kinematic hardening rule and the Drucker–Palgen plastic modulus equation, is incorporated into an ANSYS material model subroutine. The modified ANSYS program is verified against three sets of experimental results. The simulations from this modified ANSYS show a significant improvement over the unmodified ANSYS and the ABAQUS codes. DA - 1998/7// PY - 1998/7// DO - 10.1016/S0308-0161(98)00070-2 VL - 75 IS - 8 SP - 643-652 SN - 0308-0161 KW - cyclic plasticity KW - ratcheting experiments KW - ratcheting analyses KW - piping analyses KW - ASME code ER - TY - BOOK TI - Cornelius Lanczos: Collected published papers with commentaries AU - Davis, W. R. AU - Chu, M. T. AU - McConnell, J. R. AU - Dolan, P. AU - Norris, L. K. AU - Ortiz, E. AU - Plemmon, R. J. AU - Ridgeway, D. AU - Scaife, B.K.P. AU - Stewart, W. J. AU - York, J. W. AU - Doggett, W. O. AU - Gellai, B. M. AU - Gsponer, A. A. AU - Prioli, C. A. CN - QC19.3 .L363 1998 DA - 1998/// PY - 1998/// PB - Raleigh, NC: College of Physical and Mathematical Sciences, North Carolina State University SN - 0929493003 ER - TY - JOUR TI - A software approach to avoiding spatial cache collisions in parallel processor systems AU - Wong, DC AU - Davis, EW AU - Young, JO T2 - IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS AB - In parallel processor systems, the performance of individual processors is a key factor in overall performance. Processor performance is strongly affected by the behavior of cache memory in that high hit rates are essential for high performance. Hit rates are lowered when collisions on placing lines in the cache force a cache line to be replaced before it has been used to best effect. Spatial cache collisions occur if data structures and data access patterns are misaligned. We describe a mathematical scheme to improve alignment and enhance performance in applications which have moderate-to-large numbers of arrays, where various dimensionalities are involved in localized computation and array access patterns are sequential. These properties are common in many computational modeling applications. Furthermore, the scheme provides a single solution when an application is targeted to run on various numbers of processors in power-of-two sizes. The applicability of the proposed scheme is demonstrated on testbed code for an air quality modeling problem. DA - 1998/6// PY - 1998/6// DO - 10.1109/71.689447 VL - 9 IS - 6 SP - 601-608 SN - 1558-2183 KW - cache collision KW - cache offset KW - direct-mapped cache KW - highly parallel systems KW - sequential DO-loops ER - TY - JOUR TI - A pentagonal number sieve AU - Corteel, S AU - Savage, CD AU - Wilf, HS AU - Zeilberger, D T2 - JOURNAL OF COMBINATORIAL THEORY SERIES A AB - We prove a general “pentagonal sieve” theorem that has corollaries such as the following. First, the number of pairs of partitions of n that have no parts in common isp(n)2−p(n−1)2−p(n−2)2+p(n−5)2+p(n−7)2−….Second, if two unlabeled rooted forests of the same number of vertices are chosen i.u.a.r., then the probability that they have no common tree is .8705… . Third, iff,gare two monic polynomials of the same degree over the fieldGF(q), then the probability thatf,gare relatively prime is 1−1/q. We give explicit involutions for the pentagonal sieve theorem, generalizing earlier mappings found by Bressoud and Zeilberger. DA - 1998/5// PY - 1998/5// DO - 10.1006/jcta.1997.2846 VL - 82 IS - 2 SP - 186-192 SN - 0097-3165 ER - TY - JOUR TI - Speakers, listeners and communication: Explorations in discourse analysis. By G. Brown AU - Thomas, L. T. T2 - Quarterly Journal of Speech DA - 1998/// PY - 1998/// VL - 84 IS - 1 SP - 128-129 ER - TY - JOUR TI - Optimizing tensor product computations in stochastic automata networks AU - Fernandes, P. AU - Plateau, B. AU - Stewart, W. J. T2 - RAIRO. Recherche Operationnelle = Operations Research AB - In this paper we consider some numerical issues in computing solutions to networks of stochastic automata (SAN). In particular our concern is with keeping the amount of computation per iteration to a minimum, since iterative methods appear to be the most effective in determining numerical solutions. In a previous paper we presented complexity results concerning the vector-descriptor multiplication phase of the analysis. In this paper our concern is with optimizations related to the implementation of this algorithm. We also consider the possible benefits of grouping automata in a SAN with many small automata, to create an equivalent SAN having a smaller number of larger automata. DA - 1998/// PY - 1998/// DO - 10.1051/ro/1998320303251 VL - 32 IS - 3 SP - 325-351 ER - TY - JOUR TI - Highlights of statistical signal and array processing AU - Chen, TH AU - Hero, A AU - Djuric, PM AU - Messer, H AU - Goldberg, J AU - Thomson, DJ AU - Amin, MG AU - Krim, H AU - Pesquet, JC AU - Giannakis, G AU - Swami, A AU - Tugnait, JK AU - Cardoso, JF AU - Tong, L AU - Krolik, J T2 - IEEE SIGNAL PROCESSING MAGAZINE AB - The Statistical Signal and Array Processing Technical Committee (SSAP-TC) deals with signals that are random and processes an array of signals simultaneously. The field of SSAP represents both solid theory and practical applications. Starting with research in spectrum estimation and statistical modeling, study in this field is always full of elegant mathematical tools such as statistical analysis and matrix theory. The area of statistical signal processing expands into estimation and detection algorithms, time-frequency domain analysis, system identification, and channel modeling and equalization. The area of array signal processing also extends into multichannel filtering, source localization and separation, and so on. This article represents an endeavor by the members of the SSAT-TC to review all the significant developments in the field of SSAP. To provide readers with pointers for further study of the field, this article includes a very impressive bibliography-close to 500 references are cited. This is just one of the indications that the field of statistical signals has been an extremely active one in the signal processing community. The article also introduces the recent reorganization of three technical committees of the Signal Processing Society. DA - 1998/9// PY - 1998/9// DO - 10.1109/79.708539 VL - 15 IS - 5 SP - 21-64 SN - 1558-0792 ER - TY - JOUR TI - Efficient descriptor-vector multiplications in stochastic automata networks AU - Fernandes, P AU - Plateau, B T2 - JOURNAL OF THE ACM AB - This paper examines numerical issues in computing solutions to networks of stochastic automata. It is well-known that when the matrices that represent the automata contain only constant values, the cost of performing the operation basic to all iterative solution methods, that of matrix-vector multiply, is given by ρ N = Π N i-1 n i × Σ N i=1 n i , where n i is the number of states in the i th automaton and N is the number of automata in the network. We introduce the concept of a generalized tensor product and prove a number of lemmas concerning this product. The result of these lemmas allows us to show that this relatively small number of operations is sufficient in many practical cases of interest in which the automata contain functional and not simply constant transitions. Furthermore, we show how the automata should be ordered to achieve this. DA - 1998/5// PY - 1998/5// DO - 10.1145/278298.278303 VL - 45 IS - 3 SP - 381-414 SN - 1557-735X KW - generalized tensor algebra KW - Markov chains KW - stochastic automata networks KW - vector-descriptor multiplication ER - TY - JOUR TI - Trans-substituted porphyrin building blocks bearing iodo and ethynyl groups for applications in bioorganic and materials chemistry AU - Ravikanth, M AU - Strachan, JP AU - Li, FR AU - Lindsey, JS T2 - TETRAHEDRON AB - The modular synthesis of linear or cyclic multiporphyrin arrays relies on the availability of trans-substituted porphyrin building blocks with high solubility in organic solvents. Eleven porphyrin building blocks were synthesized bearing iodo, ethynyl, and 2-(trimethylsilyl)ethynyl groups at the 4-, 3-, or 3,5-positions of two meso-aryl units, and mesityl groups at the other two meso-positions. The synthesis involves condensation of 5-mesityldipyrromethane with one or two aryl aldehydes. Combinations of functional groups include di-iodo, tetra-iodo, bis[(2-(trimethylsilyl)ethynyl], iodo and 2-(trimethylsilyl)ethynyl, and ethynyl and 2-(trimethylsilyl)ethynyl. In addition, a porphyrin bearing one 4-iodophenyl group and one 3,5-bis(boron-dipyrrin)phenyl group was synthesized for applications in molecular photonic devices. The iodo and ethynyl groups are ideally-suited for Pd-mediated coupling reactions, allowing the porphyrin building blocks to be joined in the systematic construction of soluble multiporphyrin arrays. DA - 1998/7/2/ PY - 1998/7/2/ DO - 10.1016/S0040-4020(98)00408-6 VL - 54 IS - 27 SP - 7721-7734 SN - 0040-4020 ER - TY - JOUR TI - Prevention of antibiotic residues in veal calves fed colostrum AU - Rangel-Lugo, M. AU - Payne, M. AU - Webb, A. I. AU - Riviere, J. E. AU - Craigmill, A. T2 - Journal of the American Veterinary Medical Association DA - 1998/// PY - 1998/// VL - 213 IS - 1 SP - 40-42 ER - TY - JOUR TI - Pressurized water reactor core maneuvering utilizing optimal control theory AU - Ye, JQ AU - Turinsky, PJ T2 - NUCLEAR SCIENCE AND ENGINEERING AB - The computational capability of automatically determining the optimal control strategies for pressurized water reactor core maneuvering, in terms of an operating strategy generator (OSG), has been ... DA - 1998/6// PY - 1998/6// DO - 10.13182/NSE98-A1967 VL - 129 IS - 2 SP - 97-123 SN - 0029-5639 ER - TY - JOUR TI - On the structure of stochastic matrices with a subdominant eigenvalue near 1 AU - Hartfiel, DJ AU - Meyer, CD T2 - LINEAR ALGEBRA AND ITS APPLICATIONS AB - An n × n irreducible stochastic matrix P can possess a subdominant eigenvalue, say λ2(P), near λ = 1. In this article we clarify the relationship between the nearness of these eigenvalues and the near-uncoupling (some authors say “nearly completely decomposable”) of P. We prove that for fixed n, if λ2(P) is sufficiently close to λ = 1, then P is nearly uncoupled. We then provide examples which show that λ2(P) must, in general, be remarkably close to 1 before such uncoupling occurs. DA - 1998/3/15/ PY - 1998/3/15/ DO - 10.1016/s0024-3795(97)00333-9 VL - 272 SP - 193-203 SN - 0024-3795 ER - TY - JOUR TI - Interaction with a mixed-initiative system for exploratory data analysis AU - St. Amant, R. AU - Cohen, P. R. T2 - Knowledge-based Systems AB - Exploratory data analysis (EDA) plays an increasingly important role in statistical analysis. EDA is difficult, however, even with the help of modern statistical software. We have developed an assistant for data exploration, based on Al planning techniques, that addresses some of the strategic shortcomings of conventional software. This paper describes the design and behavior of the system and discusses an experimental evaluation that demonstrates the effectiveness of our approach. DA - 1998/// PY - 1998/// DO - 10.1016/s0950-7051(97)00038-5 VL - 10 IS - 5 SP - 265-273 ER - TY - JOUR TI - Electrochemical and spectroelectrochemical study of a bis(arylgalvinol)-substituted alkyl disulfide monolayer and mixed monolayers on polycrystalline gold AU - Sagara, T AU - Midorikawa, T AU - Shultz, DA AU - Zhao, Q T2 - LANGMUIR AB - The monolayer of bis(arylgalvinol)-substituted alkyl disulfide and mixed monolayers with decanethiol (DT) on a polycrystalline gold electrode were characterized in an aqueous solution by means of cyclic voltammetry and in situ electroreflectance (ER) spectroscopy. Both neat and mixed monolayers exhibited a quasi-reversible redox response of galvinol/galvinoxyl radical couple (GalH/Gal•) at the same formal potentials. The ER signal involved responses due to both the redox reaction and the Stark effect on Gal•. The ER spectrum of the redox reaction showed a difference absorption spectral feature, and it was found that the absorption bands of both immobilized GalH and Gal• are red shifted in comparison to their absorption bands measured in organic solvents. The ER spectral profile for the redox reaction was unaffected by mixing with DT, while the contribution of Stark effect on Gal• to the ER signal was significantly suppressed by increasing the amount of DT in the monolayer. The amount of immobilized GalH increased to larger than that of the neat monolayer as the mixing ratio of DT was increased up to 0.65, though further increases in the ratio resulted in a decrease in the amount of immobilized GalH. The increased mixing of DT narrowed the width of the CV peaks, consistent with an accelerated electron-transfer rate constant for the mixed monolayers. These results suggest that the neat monolayer may be disordered, while DT may mix well with the disulfide on the Au surface and force the monolayer to be more well-ordered. DA - 1998/6/13/ PY - 1998/6/13/ DO - 10.1021/la980136z VL - 14 IS - 13 SP - 3682-3690 SN - 0743-7463 ER - TY - JOUR TI - Adventitious root initiation in hypocotyl and epicotyl cuttings of eastern white pine (Pinus strobus) seedlings AU - Goldfarb, B AU - Hackett, WP AU - Furnier, GR AU - Mohn, CA AU - Plietzsch, A T2 - PHYSIOLOGIA PLANTARUM AB - The present paper reports results of experiments to develop a system for studying adventitious root initiation in cuttings derived from seedlings. Hypocotyl cuttings of 2‐week‐old eastern white pine ( Pinus strobus L.) seedlings were treated for 5 min with 0, 100, 200, 300, 400, 500 or 600 mg l −1 (0, 0.54, 1.07, 1.61, 2.15, 2.69 or 3.22 m M ) 1‐naphthaleneacetic acid (NAA) to determine the effect on root initiation. The number of root primordia per cutting was correlated with NAA concentration and the square of NAA concentration. Thus, the number increased from less than one per cutting in the 0 NAA treatment to approximately 40 per cutting at 300 mg l‐1 NAA, above which no substantial further increase was observed. The larger number of root primordia formed in response to increasing concentrations of NAA was due to the formation of primordia over a larger proportion of the hypocotyls. Histological analysis of the timing of root primordium formation in hypocotyl cuttings revealed three discernible stages. Progression through these stages was relatively synchronous among NAA‐treated hypocotyl cuttings and within a given cutting, but variation was observed in the portion of different cuttings undergoing root formation. Control‐treated hypocotyl cuttings formed root primordia at lower frequencies and more slowly than NAA‐treated cuttings, with fewer primordia per cutting. Epicotyl cuttings from 11‐week‐old seedlings also formed adventitious roots, but more slowly than hypocotyl cuttings. NAA treatment of epicotyl cuttings caused more rapid root initiation and also affected the origin of adventitious roots in comparison with nontreated cuttings. NAA‐treated epicotyl cuttings formed roots in a manner analogous to that of the hypocotyl cuttings, directly from preformed vascular tissue, while control‐treated epicotyl cuttings first formed a wound or callus tissue and subsequently differentiated root primordia within that tissue. This system of inducing adventitious roots in pine stem cuttings lends itself to studying the molecular and biochemical steps that occur during root initiation and development. DA - 1998/4// PY - 1998/4// DO - 10.1034/j.1399-3054.1998.1020405.x VL - 102 IS - 4 SP - 513-522 SN - 1399-3054 KW - adventitious roots KW - auxin KW - cuttings KW - eastern white pine KW - epicotyl KW - histology KW - hypocotyl KW - juvenility KW - maturation KW - 1-naphthaleneacetic acid KW - Pinus strobus KW - rooting ER - TY - JOUR TI - Prevalence of heartworm infection in cats with signs of cardiorespiratory abnormalities AU - Atkins, C. E. AU - DeFrancesco, T. C. AU - Miller, M. W. AU - Meurs, K. M. AU - Keene, B. T2 - Journal of the American Veterinary Medical Association DA - 1998/// PY - 1998/// VL - 212 IS - 4 SP - 517-520 ER - TY - JOUR TI - Algorithms for trigonometric curves (simplification, implicitization, parameterization) AU - Hong, H AU - Schicho, J T2 - JOURNAL OF SYMBOLIC COMPUTATION AB - A trigonometric curve is a real plane curve where each coordinate is given parametrically by a truncated Fourier series. The trigonometric curves frequently arise in various areas of mathematics, physics, and engineering. Some trigonometric curves can also be represented implicitly by bivariate polynomial equations. In this paper, we give algorithms for (a) simplifying a given parametric representation, (b) computing an implicit representation from a given parametric representation, and (c) computing a parametric representation from a given implicit representation. DA - 1998/9// PY - 1998/9// DO - 10.1006/jsco.1998.0212 VL - 26 IS - 3 SP - 279-300 SN - 0747-7171 ER - TY - JOUR TI - Optimal scheduling algorithm for distributed-memory machines AU - Darbha, S AU - Agrawal, DP T2 - IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS AB - Task Scheduling is one of the key elements in any distributed-memory machine (DMM), and an efficient algorithm can help reduce the interprocessor communication time. As optimal scheduling of tasks to DMMs is a strong NP-hard problem, many heuristic algorithms have been introduced in the literature. This paper presents a Task Duplication based Scheduling (TDS) algorithm which can schedule directed acyclic graphs (DAGs) with a complexity of O(|V|/sup 2/), where |V| is the number of tasks in the DAG. This algorithm generates an optimal schedule for a class of DAGs which satisfy a simple cost relationship. The performance of the algorithm has been observed by its application to some practical DAGs, and by comparing it with other existing scheduling schemes in terms of the schedule length and algorithm complexity. DA - 1998/1// PY - 1998/1// DO - 10.1109/71.655248 VL - 9 IS - 1 SP - 87-95 SN - 1045-9219 KW - directed acyclic graph KW - distributed-memory machines KW - optimal scheduling algorithms KW - task duplication KW - task scheduling ER - TY - JOUR TI - Indentation-Energy-to-Fracture (IEF) parameter for characterization of DBTT in carbon steels using nondestructive Automated Ball Indentation (ABI) technique AU - Haggag, F. M. AU - Byun, T. S. AU - Hong, J. H. AU - Miraglia, P. Q. AU - Murty, K. L. T2 - Scripta Materialia DA - 1998/// PY - 1998/// VL - 38 IS - 4 SP - 645-651 ER - TY - JOUR TI - Fractal-based classification of natural textures AU - Potlapalli, H AU - Luo, RC T2 - IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS AB - Texture classification is an important first step in image segmentation and image recognition. The classification algorithm must be able to overcome distortions, such as scale, aspect and rotation changes in the input texture. In this paper, a new fractal model for texture classification is presented. The model is based on fractional Brownian motion (FBM). It is also shown that this model is invariant to changes in incident light; empirical results are also given. The isotropic nature of Brownian motion is particularly useful for outdoor applications, where the viewing direction may change. Classification results of this model are presented; comparisons with other texture measurement models indicate that the incremental FBM (IFBM) model has better performance for the samples tested. DA - 1998/2// PY - 1998/2// DO - 10.1109/41.661315 VL - 45 IS - 1 SP - 142-150 SN - 1557-9948 KW - Brownian motion KW - fractals KW - texture classification ER - TY - JOUR TI - A process algebra with distributed priorities AU - Cleaveland, R AU - Luttgen, G AU - Natarajan, V T2 - THEORETICAL COMPUTER SCIENCE AB - This paper presents a process algebra for distributed systems in which some actions may take precedence over others. The algebra is distinguished by the design decision that it only allows actions to pre-empt others at the same “location” and therefore captures a notion of localized precedence . Using Park's and Milner's notion of strong bisimulation as a basis, we develop a behavioral congruence and axiomatize it for finite processes; we also derive an associated observational congruence and present logical characterizations of our behavioral relations. Simple examples highlight the utility of the theory. DA - 1998/3/30/ PY - 1998/3/30/ DO - 10.1016/S0304-3975(97)00221-1 VL - 195 IS - 2 SP - 227-258 SN - 0304-3975 KW - process algebra KW - distributed priority KW - bisimulation KW - localized pre-emption KW - axiomatization ER - TY - JOUR TI - A global nonhydrostatic semi-Lagrangian atmospheric model with orography AU - Qian, JH AU - Semazzi, FHM AU - Scroggs, JS T2 - MONTHLY WEATHER REVIEW AB - A global nonhydrostatic semi-implicit semi-Lagrangian (SISL) atmospheric model with orography has been developed. The height-based terrain-following σz coordinate of Gal-Chen and Somerville is used to incorporate the orography. A 3D vector form of the SISL formulation is proposed. It is based on the complete Navier–Stokes equations. The model is stable for large time steps of up to 1 h at horizontal/vertical resolution of 2.8125°/1200 m. Isolated bell-shaped mountain profiles and real orography are employed to evaluate the model performance. The sensitivity of the model with orography to the order of accuracy of the uncentering scheme, the reference temperature (T), and size of the time step are similar to that of the model without orography described in Semazzi et al. The authors find that for successful execution of the model, it is important that the orographic height Zs, the reference state mass variable (qs), and T satisfy the hydrostatic balance relationship in the terrain-following σz coordinate system. This formulation effectively controls the generation of unphysical orographic induced computational noise usually encountered in connection with semi-Lagrangian models. The global model used here is based on the complete dynamical Navier–Stokes equations, however, it is run at coarse resolutions, for which nonhydrostatic effects are negligible. In the future, when the computing resources permit, the model will be a valuable vehicle for investigating the role of multiple-scale interaction, including the effects of nonhydrostatic dynamics. DA - 1998/3// PY - 1998/3// DO - 10.1175/1520-0493(1998)126<0747:AGNSLA>2.0.CO;2 VL - 126 IS - 3 SP - 747-771 SN - 0027-0644 ER - TY - JOUR TI - Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing AU - Baugh, JW AU - Kakivaya, GKR AU - Stone, , JR T2 - ENGINEERING OPTIMIZATION AB - Abstract Numerous techniques for generating approximate solutions have been proposed in the last decade for routing and scheduling in multi-vehicle dial-a-ride problems. While some of these techniques have mathematical foundations, it is often difficult to assess the global optimality of the generated solution due to the use of pure local improvement methods. In additon, most of these methods are based on a single objective, such as minimization of the number of vehicles used, and cannot account for different or competing objectives that characterize the problem. This paper proves the intractability of the dial-a-ride problem, and then describes a new approximate method based on simulated annealing that is used to solve these problems in the presence of multiple objectives. DA - 1998/// PY - 1998/// DO - 10.1080/03052159808941240 VL - 30 IS - 2 SP - 91-123 SN - 0305-215X UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0031680443&partnerID=MN8TOARS KW - dial-a-ride problem KW - simulated annealing KW - multiobjective programming KW - decision-support systems ER - TY - JOUR TI - The idea behind Krylov methods AU - Ipsen, ICF AU - Meyer, CD T2 - AMERICAN MATHEMATICAL MONTHLY AB - Click to increase image sizeClick to decrease image size Additional informationNotes on contributorsIlse C. F. IpsenILSE IPSEN received a Vordiplom in computer science/mathematics from the Universität Kaiserslautern in Germany and a Ph.D. in computer science from Penn State. Before joining the Mathematics Department at North Carolina State University she taught computer science at Yale. Her research interests include numerical linear algebra and scientific computing.Carl D. MeyerCARL MEYER is a professor of Mathematics at North Carolina State University. He received an undergraduate degree in mathematics from the University of Northern Colorado and a Masters and Ph.D. degree in mathematics from Colorado State University. His research interests include matrix and numerical analysis, and applied probability. He has served as Managing Editor for the SIAM Journal on Algebraic and Discrete Methods (now SIMAX), and he is the author of a new text, Matrix Analysis and Applied Linear Algebra. DA - 1998/12// PY - 1998/12// DO - 10.2307/2589281 VL - 105 IS - 10 SP - 889-899 SN - 1930-0972 ER - TY - JOUR TI - Resident perceptions of tourism in a resort town AU - Korca, P T2 - LEISURE SCIENCES AB - This article describes a part of the survey research conducted in Antalya, Turkey, whose aim was to gain a better understanding of resident attitudes and perceptions of tourism. Factor analysis applied to impact statements yielded nine reliable dimensions of tourism impacts as perceived by local residents. The most important dimensions were effect of tourist crowds, impact on built environment, and impact on social values. The study findings suggest that residents of Antalya could differentiate between benefits and costs while still remaining predominantly supportive of tourism. In addition, this study empirically verified that residents with the highest overall level of support for tourism expansion in Antalya tended to be people who were more educated, did not live in the proximity of the city's central tourist area, were more frequent users of tourism facilities, had tourism‐dependent income, and were employed in jobs that had a direct relation to tourism. DA - 1998/// PY - 1998/// DO - 10.1080/01490409809512280 VL - 20 IS - 3 SP - 193-212 SN - 1521-0588 KW - host community KW - resident attitudes KW - survey research KW - tourism development KW - tourism impacts ER - TY - JOUR TI - Personal assistants AU - Huhns, MN AU - Singh, MP T2 - IEEE INTERNET COMPUTING AB - The agent metaphor comes packaged with a number of powerful abstractions. Some of these are psychological, such as beliefs, knowledge, and intentions-abstractions that were traditionally studied in AI. However, there are a number of other abstractions that the agent metaphor brings to the fore. Of these, one has been emphasizing the social abstractions. Close cousins of the social abstractions are the ethical and legal abstractions. These too are being recognized as increasingly important in developing agents that are not only sociable, but also well behaved. DA - 1998/// PY - 1998/// DO - 10.1109/4236.670692 VL - 2 IS - 5 SP - 90-92 SN - 1089-7801 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-11644317014&partnerID=MN8TOARS ER - TY - JOUR TI - Low parasitic resistance contacts for scaled ULSI devices AU - Osburn, CM AU - Bellur, KR T2 - THIN SOLID FILMS AB - Analysis of the components of parasitic series resistance in ULSI devices shows that interfacial contact resistivities less than 10−7 Ω cm2 will be required for sub 100-nm ULSI devices in order to stay on the historical performance trend. With dimensional scaling, the series resistance–width product decreases because channel lengths are scaled, while it increases in contacts because the contact length is decreased. Unless the contact resistivity is also reduced, the contact resistance ultimately becomes higher than the channel resistance, and no performance advantage will be obtained by making the device smaller. The challenge in meeting the contacting requirements in the 1997 National Technology Roadmap for Semiconductors is especially difficult in light of the desire to simultaneously contact both n+ and p+ junctions with a single material and given the trend towards lower processing temperatures, in which the equilibrium dopant electrical activity is lower. Several techniques, such as dielectric capping during junction annealing, are effective in reducing contact resistivity by maximizing interfacial dopant concentrations and minimizing contact barrier heights. Higher saturated drive currents, due to lowered parasitic series resistance, are observed in deep submicron devices made using silicides as diffusion sources (SADS); this technique eliminates the interfacial dopant segregation that is associated with conventional silicidation. The use of elevated source drains (ESD) also allows the use of thicker silicides while minimizing the consumption-induced increase in contact resistivity that normally accompanies silicidation; as a result, ESD devices give higher drive currents. The recrystallization of amorphous layers has been observed to result in non-equilibrium dopant activation which can be many times the equilibrium value. Finally, the use of heterojunction contacts using Si–Ge in the context of elevated source/drain devices presents another way to achieve lower contact resistance. DA - 1998/11/2/ PY - 1998/11/2/ DO - 10.1016/S0040-6090(98)01046-3 VL - 332 IS - 1-2 SP - 428-436 SN - 0040-6090 KW - contact resistance KW - ULSI devices KW - self-aligned silicides KW - elevated source/drain ER - TY - JOUR TI - Imaging basilar skull fractures in the horse: A review AU - Ramirez, O AU - Jorgensen, JS AU - Thrall, DE T2 - VETERINARY RADIOLOGY & ULTRASOUND AB - Due to the complex nature of the anatomy of the equine head, superimposition of numerous structures, and poor soft tissue differentiation, radiography may be of limited value in the diagnosis of basilar skull fractures. However, in many horses radiographic changes such as soft tissue opacification of the guttural pouch region, irregular bone margination at the sphenoccipital line, attenuation of the nasopharynx, ventral displacement of the dorsal pharyngeal wall and the presence of irregularly shaped bone fragments in the region of the guttural pouches are suggestive of a fracture of the skull base. These findings in conjunction with physical examination findings and historical information may lead to a presumptive diagnosis of a fracture. When available and when the patient will accommodate the equipment, computed tomography may give a definitive diagnosis owing to its superior resolution and differentiation of soft tissue structures. DA - 1998/// PY - 1998/// DO - 10.1111/j.1740-8261.1998.tb01624.x VL - 39 IS - 5 SP - 391-395 SN - 1058-8183 KW - basisphenoid KW - basilar skull KW - fracture KW - guttural pouch KW - equine ER - TY - JOUR TI - Cognitive agents AU - Huhns, MN AU - Singh, MP T2 - IEEE INTERNET COMPUTING AB - Several researchers have proposed using cognitive concepts as a semantic basis for agent communications (M.N. Huhns and M.P. Singh, 1997). One of the leading candidates for such a semantics is based on Arcol, the communication language used within Artimis. Interestingly, this application (not only of Arcol, but also in general) appears extremely misguided. The intentional concepts are well suited to designing agents, but are not suited to giving a basis to a public, standardizable view of communication. A challenge for using the cognitive concepts is that although they are natural in several respects and can guide implementations, full blown implementations that try to be faithful to every aspect of the model can end up being computationally demanding. As the cognitive concepts are put to use in real applications, the principles for simplifying the implementations will emerge. In any case, because of their naturalness to humans, the cognitive concepts are here to stay, and we will do well to consider them in the design of our agents. DA - 1998/// PY - 1998/// DO - 10.1109/4236.735992 VL - 2 IS - 6 SP - 87-89 SN - 1941-0131 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0010221078&partnerID=MN8TOARS ER - TY - JOUR TI - All agents are not created equal AU - Huhns, M.N. AU - Singh, Munindar P. T2 - IEEE Internet Computing AB - As the technology advances, we can expect the development of specialized agents to be used as standardized building blocks for information systems. Two trends lend credence to such a prediction. First, software systems in general are being constructed with larger components, such as ActiveX and JavaBeans, which are becoming closer to being agents themselves. They have more functionality than simple objects, respond to events autonomously, and, most importantly, respond to system builders at development time, as well as to events at runtime. Moreover, there is a move toward more cooperative information systems, in which the architecture itself plays an important role in the effectiveness of the system, as opposed to traditional software systems where effectiveness depends on the quality of the individual components. These architectures are generating a set of standardized agents. Architectures based on standardized agent types should be easier to develop, understand, and use. Perhaps most important of all, these architectures will make it easier for separately developed information systems to interoperate. DA - 1998/// PY - 1998/// DO - 10.1109/4236.683806 VL - 2 IS - 3 SP - 94-96 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-11344261363&partnerID=MN8TOARS ER - TY - JOUR TI - Agent communication languages: Rethinking the principles AU - Singh, MP T2 - COMPUTER AB - Agent communication languages have been used for years in proprietary multiagent systems. Yet agents from different vendors-or even different research projects-cannot communicate with each other. The author looks at the underlying reasons and proposes a conceptual shift from individual agent representations to social interaction. DA - 1998/12// PY - 1998/12// DO - 10.1109/2.735849 VL - 31 IS - 12 SP - 40-+ SN - 0018-9162 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0032294174&partnerID=MN8TOARS ER - TY - JOUR TI - A modular algorithm for resource allocation AU - Rhee, I T2 - DISTRIBUTED COMPUTING DA - 1998/8// PY - 1998/8// DO - 10.1007/s004460050047 VL - 11 IS - 3 SP - 157-168 SN - 0178-2770 KW - dining philosophers KW - resource allocation KW - modular construction KW - concurrency KW - message passing distributed systems ER - TY - JOUR TI - Subquadratic-time factoring of polynomials over finite fields AU - Kaltofen, E AU - Shoup, V T2 - MATHEMATICS OF COMPUTATION AB - New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of degree n n over a finite field of constant cardinality in time O ( n 1.815 ) O(n^{1.815}) . Previous algorithms required time Θ ( n 2 + o ( 1 ) ) \Theta (n^{2+o(1)}) . The new algorithms rely on fast matrix multiplication techniques. More generally, to factor a polynomial of degree n n over the finite field F q {\mathbb F}_q with q q elements, the algorithms use O ( n 1.815 log q ) O(n^{1.815} \log q) arithmetic operations in F q {\mathbb F}_q . The new “baby step/giant step” techniques used in our algorithms also yield new fast practical algorithms at super-quadratic asymptotic running time, and subquadratic-time methods for manipulating normal bases of finite fields. DA - 1998/7// PY - 1998/7// DO - 10.1090/S0025-5718-98-00944-2 VL - 67 IS - 223 SP - 1179-1197 SN - 0025-5718 KW - factoring KW - polynomials KW - finite fields KW - randomized algorithms KW - normal bases ER - TY - JOUR TI - Nucleation and growth of Pd clusters in mordenite AU - Reifsnyder, SN AU - Otten, MM AU - Lamb, HH T2 - CATALYSIS TODAY AB - The nucleation and growth of Pd clusters in mordenite were investigated using in situ extended X-ray absorption fine structure (EXAFS) spectroscopy and Fourier transform infrared (FTIR) spectroscopy of adsorbed CO. Calcination of [Pd(NH3)4]2+-exchanged mordenite at 350°C in O2 results in decomposition of the amine complex and formation of square-planar Pd2+ oxo species within the mordenite pores. Reduction of these species at 150°C in H2 yields Pd clusters with an average nuclearity of 3. On an average two 2.22 Å Pd–O bonds are associated with each Pd3 cluster; we infer that this interaction serves to anchor the clusters within the pores. After reduction at 150°C, the FTIR spectrum of irreversibly adsorbed CO is indicative of a mixture of Pd+, Pdδ+, and Pd0 carbonyl species. Reduction at 350°C produces larger intrazeolitic Pd clusters (average nuclearity of 6) that exhibit only a weak interaction with the mordenite, as evidenced by their facile aggregation in the presence of CO at 30°C. Reduction at 450°C yields large 20 Å Pd clusters that we infer are located on external mordenite surfaces or locally disrupt the intracrystalline structure. DA - 1998/3/2/ PY - 1998/3/2/ DO - 10.1016/S0920-5861(97)00121-1 VL - 39 IS - 4 SP - 317-328 SN - 0920-5861 KW - palladium catalysts KW - metal clusters KW - mordenite KW - metal-support interaction KW - EXAFS spectroscopy ER - TY - JOUR TI - Intelligent support for exploratory data analysis AU - St Amant, R AU - Cohen, PR T2 - JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS AB - Abstract Exploratory data analysis (EDA) is as much a matter of strategy as of selecting specific statistical operations. We have developed a knowledge-based planning system, called AIDE, to help users with EDA. AIDE strikes a balance between conventional statistical packages, which need guidance for every step in the exploration, and autonomous systems, which leave the user entirely out of the decision-making process. AIDE's processing is based on artificial intelligence planning techniques, which give us a useful means of representing some types of statistical strategy. In this article we describe the design of AIDE and its behavior in exploring a small, complex data set. DA - 1998/12// PY - 1998/12// DO - 10.1080/10618600.1998.10474794 VL - 7 IS - 4 SP - 545-558 SN - 1537-2715 KW - artificial intelligence KW - statistical strategy ER -