Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 10351 - 10380 of 10460

Full-Text Articles in Entire DC Network

Automated Manpower Rostering: Techniques And Experience, C. M. Khoong, Hoong Chuin Lau, L. W. Chew Jul 1994

Automated Manpower Rostering: Techniques And Experience, C. M. Khoong, Hoong Chuin Lau, L. W. Chew

Research Collection School Of Computing and Information Systems

We present ROMAN, a comprehensive, generic manpower rostering toolkit that successfully handles a wide spectrum of work policies found in service organizations. We review the use of various techniques and methodologies in the toolkit that contribute to its robustness and efficiency, and relate experience gained in addressing manpower rostering problems in industry.

Go to article

Production And Decay Of D1 (2420)0 And D2* (2460)0, Avery, P.; Et Al., M. Thulasidas Jun 1994

Production And Decay Of D1 (2420)0 And D2* (2460)0, Avery, P.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

The Myriad Federated Database Prototype, San-Yih Hwang, Ee Peng Lim, H. R. Yang, S. Musukula, K. Mediratta, M. Ganesh, D. Clements, J. Stenoien, Jaideep Srivastava May 1994

The Myriad Federated Database Prototype, San-Yih Hwang, Ee Peng Lim, H. R. Yang, S. Musukula, K. Mediratta, M. Ganesh, D. Clements, J. Stenoien, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

Myriad is a federated database system (FDBS) prototype being developed at the University of Minnesota. The main objective behind this prototyping effort is to provide "enterprise-wide" information by integrating independently developed databases while preserving the local autonomy of the component DBMSs and applications. In Myriad, multiple federations can be formed. A federation consists of an integrated database whose schema is represented as a set of integrated relations derived from the export relations provided by the component DBMSS. SQL, mainly due to its simplicity and popularity among database users and vendors, has been adopted to express global queries as well as …

Go to article

Managing Memory For Real-Time Queries, Hwee Hwa Pang, Michael J. Carey, Miron Livny May 1994

Managing Memory For Real-Time Queries, Hwee Hwa Pang, Michael J. Carey, Miron Livny

Research Collection School Of Computing and Information Systems

The demanding performance objectives that real-time database systems (RTDBS) face necessitate the use of priority resource scheduling. This paper introduces a Priority Memory Management (PMM) algorithm that is designed to schedule queries in RTDBS. PMM attempts to minimize the number of missed deadlines by adapting both its multiprogramming level and its memory allocation strategy to the characteristics of the offered workload. A series of simulation experiments confirms that PMM's admission control and memory allocation mechanisms are very effective for real-time query scheduling.

Go to article

A Measurement Of B(D+S → Φl+Ν) B(D+S → Φπ+), Cleo Collaboration, F. Butler, Manoj Thulasidas Mar 1994

A Measurement Of B(D+S → Φl+Ν) B(D+S → Φπ+), Cleo Collaboration, F. Butler, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

Using the CLEO II detector at CESR, we have measured the ratio of branching fractions B(D → φlν) B(D → φπ) = 0.54 ± 0.05 ± 0.04. We use this measurement to obtain a model dependent estimate of B(D → φπ). © 1994.

Go to article

Automating Output Size And Reuse Metrics In A Repository-Based Computer-Aided Software Engineering (Case) Environment, R. D. Banker, Robert J. Kauffman, C. Wright, D. Zweig Mar 1994

Automating Output Size And Reuse Metrics In A Repository-Based Computer-Aided Software Engineering (Case) Environment, R. D. Banker, Robert J. Kauffman, C. Wright, D. Zweig

Research Collection School Of Computing and Information Systems

Measurement of software development productivity is needed in order to control software costs, but it is discouragingly labor-intensive and expensive. Computer-aided software engineering (CASE) technologies-especially repository-based, integrated CASE-have the potential to support the automation of this measurement. We discuss the conceptual basis for the development of automated analyzers for function point and software reuse measurement for object-based CASE. Both analyzers take advantage of the existence of a representation of the application system that is stored within an object repository, and that contains the necessary information about the application system. We also discuss metrics for software reuse measurement, including reuse leverage, …

Go to article

Precision Measurement Of The Ds*+-Ds+ Mass Difference, Brown, D.; Et Al., M. Thulasidas Jan 1994

Precision Measurement Of The Ds*+-Ds+ Mass Difference, Brown, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

We have measured the vector-pseudoscalar mass splitting M(D*+s)-M(D+s)=144.22±0.47±0.37 MeV significantly more precisely than the previous world average. We minimize the systematic errors by also measuring the vector-pseudoscalar mass difference M(D*0)-M(D0) using the radiative decay D*0→D0γ, obtaining [M(D*+s)-M(D+s)]-[M(D*0)-M(D0)] =2.09±0.47±0.37 MeV. This is then combined with our previous high-precision measurement of M(D*0)-M(D0), which used the decay D*0→D0π0. We also measure the mass difference M(D+s)-M(D+)=99.5±0.6±0.3 MeV, using the φπ+ decay modes of the D+s and D+ mesons.

Go to article

Study Of The Five-Charged-Pion Decay Of The Τ Lepton, D. Gibaut, Manoj Thulasidas Jan 1994

Study Of The Five-Charged-Pion Decay Of The Τ Lepton, D. Gibaut, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

The branching fractions for the five-charged-particle decays of the τ lepton have been measured in e+e− annihilations using the CLEO II detector at the Cornell Electron Storage Ring. Assuming all charged particles to be pions, the results are B(3π−2π+≥0 neutrals ντ)=(0.097±0.005±0.011)%, B(3π−2π+ντ)=(0.077±0.005 ±0.009)%, B(3π−2π+π0ντ)=(0.019±0.004±0.004)%, and B(3π−2π+2π0ντ)B(3π−2π−π0ντ) is measured for the first time by exclusive π0 reconstruction. The results are compared with the predictions from the partially conserved-axial-current and conserved-vector-current hypotheses assuming isospin invariance.

Go to article

Measurement Of Cabibbo-Suppressed Decays Of The Τ Lepton, Battle, M.; Et Al., M. Thulasidas Jan 1994

Measurement Of Cabibbo-Suppressed Decays Of The Τ Lepton, Battle, M.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Measurement Of The Cross Section For Γγ→Pp̄, Artuso, M.; Et Al., M. Thulasidas Jan 1994

Measurement Of The Cross Section For Γγ→Pp̄, Artuso, M.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Observation Of Inclusive B Decays To The Charmed Baryons C++ And C0, Procario, M.; Te Al., M. Thulasidas Jan 1994

Observation Of Inclusive B Decays To The Charmed Baryons C++ And C0, Procario, M.; Te Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Resolving Attribute Incompatibility In Database Integration: An Evidential Reasoning Approach, Ee-Peng Lim, Shashi Shekhar Jan 1994

Resolving Attribute Incompatibility In Database Integration: An Evidential Reasoning Approach, Ee-Peng Lim, Shashi Shekhar

Research Collection School Of Computing and Information Systems

Resolving domain incompatibility among independently developed databases often involves uncertain information. DeMichiel (1989) showed that uncertain information can be generated by the mapping of conflicting attributes to a common domain, based on some domain knowledge. The authors show that uncertain information can also arise when the database integration process requires information not directly represented in the component databases, but can be obtained through some summary of data. They therefore propose an extended relational model based on Dempster-Shafer theory of evidence (1976) to incorporate such uncertain knowledge about the source databases. They also develop a full set of extended relational operations …

Go to article

A Semantic Framework For Understanding The Behavior Of Modules And Classes In Programming Languages, Mahesh Dodani, Benjamin Kok Siew Gan Jan 1994

A Semantic Framework For Understanding The Behavior Of Modules And Classes In Programming Languages, Mahesh Dodani, Benjamin Kok Siew Gan

Research Collection School Of Computing and Information Systems

Recent trends in programming language design and implementation are aimed at integrating the two most important constructs to combat complexity: modules and classes. Both constructs provide encapsulation, a cornerstone of reliable programming. These constructs differ in their approach to building hierarchies: modules define visibility of components while classes define visibility of functionality. How can modules and classes be effectively integrated within a simple programming language? This question captures the essence of developing semantics of these constructs to ensure that they interact in a meaningful way. This paper develops a formal denotational semantic framework for understanding the interaction between classes and …

Go to article

Measurement Of The Branching Fraction For D+K-++, Balest, R.; Et Al., M. Thulasidas Jan 1994

Measurement Of The Branching Fraction For D+K-++, Balest, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Using the CLEO II detector at the Cornell Electron Storage Ring we have measured the ratio of branching fractions, B(D+K-++)/(D0K-+)=2.350.160.16. Our recent measurement of scrB(D0K-+) then gives scrB(D+K-++)=(9.30.60.8)%.

Go to article

Managing Risks In Information Technology Projects, Boon Siong Neo, Kwong Sin Leong Jan 1994

Managing Risks In Information Technology Projects, Boon Siong Neo, Kwong Sin Leong

Research Collection School Of Accountancy

The development and implementation of IT (Information Technology) projects are plagued with problems of cost and time overruns. technical inadequacy, inability to meet user requirements. lack of utilization. and failure to achieve anticipated benefits. These problems occur to some projects and not to others because I) IT projects have different profiles of risk. and 2) IT project risks have been managed more or less effectively. This paper synthesizes the literature into four classes of risks. and applies it to evaluate TradeNet. an EDLbased trading system implemented in Singapore in I989. Through a case study of TradeNet. we derived a typology …

Go to article

Exclusive Hadronic B Decays To Charm And Charmonium Final States, Alam, M.; Et Al., M. Thulasidas Jan 1994

Exclusive Hadronic B Decays To Charm And Charmonium Final States, Alam, M.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

We have fully reconstructed decays of both B¯0 and B− mesons into final states containing either D, D*, D**, ψ, ψ’, or χc1 mesons. This allows us to obtain new results on many physics topics including branching ratios, tests of the factorization hypothesis, color suppression, resonant substructure, and the B−−B¯0 mass difference.

Go to article

Observation Of A New Charmed Strange Meson, Kubota, Y.; Et Al., M. Thulasidas Jan 1994

Observation Of A New Charmed Strange Meson, Kubota, Y.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

On The Equivalence Of Mceliece's And Niederreiter's Public-Key Cryptosystems, Y. X. Li, Robert H. Deng, X. M. Wang Jan 1994

On The Equivalence Of Mceliece's And Niederreiter's Public-Key Cryptosystems, Y. X. Li, Robert H. Deng, X. M. Wang

Research Collection School Of Computing and Information Systems

It is shown that McEliece's and Niederreiter's public-key cryptosystems are equivalent when set up for corresponding choices of parameters. A security analysis for the two systems based on this equivalence observation, is presented

Go to article

Identifying Faces Using Multiple Retrievals, Jian Kang Wu, Arcot Desai Narasimhalu Jan 1994

Identifying Faces Using Multiple Retrievals, Jian Kang Wu, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

During a police investigation, officers often have to sort through hundreds of photographs to identify a suspect. To aid this task, we at the Institute of Systems Science developed and implemented a flexible database system that can retrieve faces using personal information, fuzzy and free-text descriptors, and classification trees.

Go to article

A Probabilistic Approach To Fault Diagnosis In Linear Lightwave Networks, Robert H. Deng, A. A. Lazar, W. Wang Dec 1993

A Probabilistic Approach To Fault Diagnosis In Linear Lightwave Networks, Robert H. Deng, A. A. Lazar, W. Wang

Research Collection School Of Computing and Information Systems

The application of probabilistic reasoning to fault diagnosis in linear lightwave networks (LLNs) is investigated. The LLN inference model is represented by a Bayesian network (or causal network). An inference algorithm is proposed that is capable of conducting fault diagnosis (inference) with incomplete evidence and on an interactive basis. Two belief updating algorithms are presented which are used by the inference algorithm for performing fault diagnosis. The first belief updating algorithm is a simplified version of the one proposed by Pearl (1988) for singly connected inference models. The second belief updating algorithm applies to multiply connected inference models and is …

Go to article

User-Database Interface: The Effect Of Abstraction Levels On Query Performance, Hock Chuan Chan, Kwok Kee Wei, Keng Siau Dec 1993

User-Database Interface: The Effect Of Abstraction Levels On Query Performance, Hock Chuan Chan, Kwok Kee Wei, Keng Siau

Research Collection School Of Computing and Information Systems

A common classification of data models is based on their abstraction levels: physical, logical and conceptual. The user-database interaction can be similarly classified. For the conceptual-level interaction, the user and the database exchange information on the user's world, e.g., information of entities, relationships, and attributes. For the logical-level interaction, the user and the database communicate based on concepts in the database system, e.g., relations and join operations. We expect users to be familiar with concepts in their world but not the concepts in the database system. This is especially so for infrequent or naive database users. The conceptual level should …

Go to article

Asynchronous Transaction Commitment In Federated Database Systems, San-Yih Hwang, Ee Peng Lim, Jaideep Srivastava Dec 1993

Asynchronous Transaction Commitment In Federated Database Systems, San-Yih Hwang, Ee Peng Lim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

We propose a new (and restricted) model for global transactions which allows asynchronous commitment of subtransactions. Our model requires each global transaction to have a fixed structure with update to the data in at most one database. Based on this transaction model, we present two concurrency control algorithms, namely Asynchronous Site Graph and Asynchronous VirtGlobalSG, which employ asynchronous commitment and achieve global serializability. Compared to other proposed algorithms, our algorithms employ asynchronous commitment so as to increase transaction performance. Furthermore, our algorithms do not put restrictions on transaction data access or local histories.

Go to article

Dynamic Decision Modeling In Medicine: A Critique Of Existing Formalisms, Tze-Yun Leong Dec 1993

Dynamic Decision Modeling In Medicine: A Critique Of Existing Formalisms, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

Dynamic decision models are frameworks for modeling and solving decision problems that take into explicit account the effects of time. These formalisms are based on structural and semantical extensions of conventional decision models, e.g., decision trees and influence diagrams, with the mathematical definitions of finite-state semi-Markov processes. This paper identifies the common theoretical basis of existing dynamic decision modeling formalisms, and compares and contrasts their applicability and efficiency. It also argues that a subclass of such dynamic decision problems can be formulated and solved more effectively with non-graphical techniques. Some insights gained from this exercise on automating the dynamic decision …

Go to article

Query Optimization And Processing In Federated Database Systems, Ee Peng Lim, Jaideep Srivastava Nov 1993

Query Optimization And Processing In Federated Database Systems, Ee Peng Lim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Multiple Query Optimization With Depth-First Branch-And-Bound, Ahmet Cosar, Ee Peng Lim, Jaideep Srivastava Nov 1993

Multiple Query Optimization With Depth-First Branch-And-Bound, Ahmet Cosar, Ee Peng Lim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

In certain database applications such as deductive databases, batch query processing, and recursive query processing etc., a single query can be transformed into a set ofclosely related database queries. Great benefits can be obtained by executing a group of related queries all together in a single unijied multi-plan instead of executing each query separately. In order to achieve this, Multiple Query Optimization (MQO) identifies common task(s) (e.g. common subezpressions, joins, etc.) among a set of query plans and creates a single unified plan (multiplan) which can be executed to obtain the required outputs forall queries at once. In this paper, …

Go to article

An Adaptive Coding Scheme With Code Combining For Mobile Radio Systems, Robert H. Deng, Huafei Zhou Nov 1993

An Adaptive Coding Scheme With Code Combining For Mobile Radio Systems, Robert H. Deng, Huafei Zhou

Research Collection School Of Computing and Information Systems

The authors propose and study an adaptive error-control coding scheme for binary digital FM (BFM) mobile radio transmission. The scheme employs code combining through packet retransmissions. The number of transmissions of a packet is in proportion to the channel fading/noise levels, which is in contrast to time diversity techniques where a fixed number of repetitions of a data packet is performed even in the absence of channel errors. Furthermore, the receiver uses received signal envelopes as channel state information, which significantly improves the throughput and bit error rate (BER) performance. Performance of the proposed scheme is analyzed for frequency-flat Rayleigh …

Go to article

Two Measurements Of B0 B-0 Mixing, J. Bartelt, Manoj Thulasidas Sep 1993

Two Measurements Of B0 B-0 Mixing, J. Bartelt, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

We have measured the B0B¯0 mixing probability, χd, using a sample of 965 000 BB¯ pairs from Υ(4S) decays. Counting dilepton events, we find χd=0.157±0.016±0.018+0.028−0.021. Using tagged B0 events, we find χd=0.149±0.023±0.019±0.010. The first (second) error is statistical (systematic). The third error reflects a ±15% uncertainty in the assumption, made in both cases, that charged and neutral B pairs contribute equally to dilepton events. We also obtain a limit on the CP impurity in the B0d system, ‖Re(ε0B)‖

Go to article

Hybrid Arq Schemes For Point-To-Multipoint Communications Over Nonstationary Broadcast Channels, Robert H. Deng Sep 1993

Hybrid Arq Schemes For Point-To-Multipoint Communications Over Nonstationary Broadcast Channels, Robert H. Deng

Research Collection School Of Computing and Information Systems

Hybrid automatic-repeat-request (ARQ) error control schemes make use of both error detection and error correction in order to achieve high throughput and low undetected error probabilities on two way channels. Two hybrid ARQ schemes, termed hybrid go-back-N (HGB- N) and hybrid selective-repeat (HSR), are proposed for point-to-multipoint communications over broadcast channels. Both schemes incorporate a concatenated code for error correction and error detection. The performance study of the hybrid schemes is based on a two-state Markov model of a burst noise channel. An analytic solution is derived for the throughput efficiency of the HSR scheme, while approximations and computer simulation …

Go to article

Entity Identification In Database Integration: An Evidential Reasoning Approach, Ee Peng Lim, Jaideep Srivastava Sep 1993

Entity Identification In Database Integration: An Evidential Reasoning Approach, Ee Peng Lim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

Entity identification is the problem of matching object instances from different databases which correspond to the same real-world entity. In this paper, we present a 2-step entity identification process in which attributes for matching tuples may be missing in certain tuples, and thus need to be derived prior to the matching. To match tuples, we require identity rules which specify the conditions to be satisfied by a pair of tuples, from different databases, before they can be considered as modeling the same real-world entity. We also introduce ILFD's (instance-level functional dependencies) as a form of inference rules which derive the …

Go to article

Facial Image Retrieval, Identification, And Inference System, Jian Kang Wu, Yew Hock Ang, Chiam Prong Lam, S. K. Moorthy, Arcot Desai Narasimhalu Aug 1993

Facial Image Retrieval, Identification, And Inference System, Jian Kang Wu, Yew Hock Ang, Chiam Prong Lam, S. K. Moorthy, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

Recognition of a human face is very easy even to a child, but is extremely difficult for computers. Here we present a Computer Aided Facial Image Identification, Retrieval and Inference System (CAFIIRIS) for criminal identification. The system stores and manages facial images and criminal records, providing necessary image and text processing, and editing tools. Inference of facial images of different ages of a person is also possible. Access to facial images can be done via key words, fuzzy descriptions, and visual browsing.

Go to article

First Prev Next Last