Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (6871)
- Databases and Information Systems (2866)
- Software Engineering (1846)
- Artificial Intelligence and Robotics (983)
- Numerical Analysis and Scientific Computing (931)
-
- Information Security (895)
- Engineering (770)
- Graphics and Human Computer Interfaces (661)
- Social and Behavioral Sciences (585)
- Business (529)
- Theory and Algorithms (438)
- Computer Engineering (394)
- Operations Research, Systems Engineering and Industrial Engineering (358)
- Programming Languages and Compilers (286)
- OS and Networks (282)
- Communication (272)
- Social Media (220)
- Public Affairs, Public Policy and Public Administration (174)
- Data Storage Systems (157)
- Transportation (156)
- Medicine and Health Sciences (145)
- Management Information Systems (141)
- Education (126)
- E-Commerce (114)
- International and Area Studies (95)
- Asian Studies (94)
- Technology and Innovation (84)
- Health Information Technology (83)
- Finance and Financial Management (77)
- Keyword
-
- Deep learning (103)
- Machine learning (86)
- Social media (65)
- Data mining (56)
- Artificial intelligence (55)
-
- Cloud computing (55)
- Reinforcement learning (51)
- Optimization (49)
- Twitter (46)
- Visualization (46)
- Online learning (45)
- Privacy (45)
- Deep Learning (44)
- Empirical study (44)
- Security (44)
- Software engineering (44)
- Task analysis (44)
- Neural networks (43)
- Feature extraction (41)
- Singapore (40)
- Access control (39)
- Semantics (39)
- Algorithms (38)
- Blockchain (36)
- Classification (36)
- Anomaly detection (34)
- Clustering (34)
- Collaboration (34)
- Android (33)
- Software (32)
- Publication Year
- File Type
Articles 6631 - 6660 of 6884
Full-Text Articles in Physical Sciences and Mathematics
On The Validity Of Digital Signatures, Jianying Zhou, Robert H. Deng
On The Validity Of Digital Signatures, Jianying Zhou, Robert H. Deng
Research Collection School Of Computing and Information Systems
An important feature of digital signatures is to serve as non-repudiation evidence. To be eligible as non-repudiation evidence, a digital signature on an electronic document should remain valid until its expiry date which is specified by some non-repudiation policy. As signature keys may be compromised and the validity of signatures may become questionable, additional security mechanisms need to be imposed on digital signatures. This paper examines the mechanisms for maintaining the validity of digital signatures, and provides a guideline on the use of these mechanisms in various context of applications.
Jotmail: A Voicemail Interface That Enables You To See What Was Said, Steve Whittaker, Richard C. Davis, Julia Hirschberg, Urs Muller
Jotmail: A Voicemail Interface That Enables You To See What Was Said, Steve Whittaker, Richard C. Davis, Julia Hirschberg, Urs Muller
Research Collection School Of Computing and Information Systems
Voicemail is a pervasive, but under-researched tool for workplace communication. Despite potential advantages of voicemail over email, current phone-based voicemail UIs are highly problematic for users. We present a novel, Web-based, voicemail interface, Jotmail. The design was based on data from several studies of voicemail tasks and user strategies. The GUI has two main elements: (a) personal annotations that serve as a visual analogue to underlying speech; (b) automatically derived message header information. We evaluated Jotmail in an 8-week field trial, where people used it as their only means for accessing voicemail. Jotmail was successful in supporting most key voicemail …
A Framework For Acquiring Domain Semantics And Knowledge For Database Integration, Roger Hsiang-Li Chiang, Ee Peng Lim, Veda C. Storey
A Framework For Acquiring Domain Semantics And Knowledge For Database Integration, Roger Hsiang-Li Chiang, Ee Peng Lim, Veda C. Storey
Research Collection School Of Computing and Information Systems
Database integration research has traditionally focused on understanding integration issues from the schema and instance perspectives. As a result, database integration approaches tend to rely on a direct comparison of schema and instance elements. However, when the integration of heterogeneous databases is performed without considering the domain semantics and knowledge of local databases such as context information and requirement specifications, an incorrect integrated database may be produced. In this research, a framework for carrying out database integration tasks using the above knowledge is proposed. The framework provides a thorough foundation to: 1. analyze database integration issues from a broad scope, …
The Integration Of Relationship Instances From Heterogeneous Databases, Ee Peng Lim, Roger Hsiang-Li Chiang
The Integration Of Relationship Instances From Heterogeneous Databases, Ee Peng Lim, Roger Hsiang-Li Chiang
Research Collection School Of Computing and Information Systems
In the process of integrating legacy databases, one has to resolve inter-database conflicts at both the schema and instance levels. In this paper, we discuss relationship conflicts as a special type of conflicts to be resolved during the database integration. Relationships are properties that relate real world objects. So far, most inter-database relationship conflicts are addressed at the schema-level by various schema integration techniques. However, instance-level relationship conflicts are largely neglected. This paper therefore investigates the causes of instance-level relationship conflicts and proposes a taxonomy for classifying instance-level relationship conflicts. In addition, we develop a systematic process to resolve instance-level …
Search For R-Parity Violating Decays Of Supersymmetric Particles In E+E- Collisions At Centre-Of-Mass Energies Near 183 Gev, R. Barate, M. Thulasidas
Search For R-Parity Violating Decays Of Supersymmetric Particles In E+E- Collisions At Centre-Of-Mass Energies Near 183 Gev, R. Barate, M. Thulasidas
Research Collection School Of Computing and Information Systems
Searches for pair-production of supersymmetric particles under the assumption that R-parity is violated via a single dominant LLE¯LLE¯, LQD¯LQD¯ or U¯D¯D¯U¯D¯D¯ coupling are performed using the data collected by the ALEPH collaboration at centre-of-mass energies of 181–184 GeV. The observed candidate events in the data are in agreement with the Standard Model expectations. Upper limits on the production cross-sections and lower limits on the masses of charginos, sleptons, squarks and sneutrinos are derived.
Study Of Charm Production In Z Decays, R. Barate, M. Thulasidas
Study Of Charm Production In Z Decays, R. Barate, M. Thulasidas
Research Collection School Of Computing and Information Systems
The production rates of D∗±D∗±, D∗±sDs∗±, D±D±, D0/D¯0D0/D¯0, D±sDs±, and Λ+c/Λ¯−cΛc+/Λ¯c− in Z→cc¯Z→cc¯ decays are measured using the LEP I data sample recorded by the ALEPH detector. The fractional energy spectrum of the D∗±D∗± is well described as the sum of three contributions: charm hadronisation, b hadron decays and gluon splitting into a pair of heavy quarks. The probability for a c quark to hadronise into a D∗+D∗+ is found to be f(c→D∗+)=0.233±0.010(stat.)±0.011(syst.)f(c→D∗+)=0.233±0.010(stat.)±0.011(syst.). The average fraction of the beam energy carried by D∗±D∗± mesons in Z→cc¯Z→cc¯ events is measured to be ⟨XE(D∗±)⟩cc¯=0.4878±0.0046(stat.)±0.0061(syst.).⟨XE(D∗±)⟩cc¯=0.4878±0.0046(stat.)±0.0061(syst.). The D∗±D∗± energy and the hemisphere mass imbalance …
Study Of Fermion Pair Production In E+E- Collisions At 130-183 Gev, R. Barate, M. Thulasidas
Study Of Fermion Pair Production In E+E- Collisions At 130-183 Gev, R. Barate, M. Thulasidas
Research Collection School Of Computing and Information Systems
The cross sections and forward-backward asymmetries of hadronic and leptonic events produced in e+e−e+e− collisions at centre-of-mass energies from 130 to 183 GeV are presented. Results for e+e−e+e−, μ+μ−μ+μ−, τ+τ−τ+τ−, qq¯qq¯, bb¯bb¯ and cc¯cc¯ production show no significant deviation from the Standard Model predictions. This enables constraints to be set upon physics beyond the Standard Model such as four-fermion contact interactions, leptoquarks, Z′Z′ bosons and R-parity violating squarks and sneutrinos. Limits on the energy scale ΛΛ of e+e−ff¯e+e−ff¯ contact interactions are typically in the range from 2 to 10 TeV. Limits on R-parity violating sneutrinos reach masses of a few …
An Integrated Data Mining System To Automate Discovery, Cecil Chua, Roger Hsiang-Li Chiang, Ee Peng Lim
An Integrated Data Mining System To Automate Discovery, Cecil Chua, Roger Hsiang-Li Chiang, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Many data analysts require tools which can integrate their database management packages (e.g. Microsoft Access) with their data analysis ones (e.g. SAS, SPSS), and provide guidance for the selection of appropriate mining algorithms. In addition, the analysts need to extract and validate statistical results to facilitate data mining. In this paper, we describe an integrated data mining system called the Linear Correlation Discovery System (LCDS) that meets the above requirement. LCDS consists of four major sub-components, two of which, the selection assistant and the statistics coupler, are discussed in this paper. The former examines the schema and instances to determine …
Solving A Supply Chain Optimization Problem Collaboratively, Hoong Chuin Lau, A. L. C. Lim, Q Liu
Solving A Supply Chain Optimization Problem Collaboratively, Hoong Chuin Lau, A. L. C. Lim, Q Liu
Research Collection School Of Computing and Information Systems
We propose a novel algorithmic framework to solve an integrated planning and scheduling problem in supply chain management. This problem involves the integration of an inventory management problem and the vehicle routing problem with time windows, both of which are known to be NP-hard. Under this framework, algorithms that solve the underlying sub-problems collaborate rigorously yet in a computationally efficient manner to arrive at a good solution. We will then present two algorithms to solve the inventory management problem: a complete mathematical model integrating integer programming with constraint programming, and an incomplete algorithm based on tabu search. We present experimental …
Some Remarks On Fair Exchange Protocol, Jianying Zhou, Robert H. Deng, Feng Bao
Some Remarks On Fair Exchange Protocol, Jianying Zhou, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
Fair exchange turns out to be an increasingly important topic due to the rapid growth of electronic commerce. An exchange is deemed to be fair if at the end of exchange, either each party receives the expected item or neither party receives any useful information about the other’s item. Several protocols for fair exchange have been proposed in recent years. In this paper, we first examine a newly published fair exchange protocol and point out its flaws and weaknesses. We then put forward a more efficient and secure protocol and give an informal analysis.
Inclusive Production Of Π0, Η, Η′ (958), Kg0s And Λ In Two- And Three-Jet Events From Hadronic Z Decays, R. Barate, M. Thulasidas
Inclusive Production Of Π0, Η, Η′ (958), Kg0s And Λ In Two- And Three-Jet Events From Hadronic Z Decays, R. Barate, M. Thulasidas
Research Collection School Of Computing and Information Systems
The production rates and the inclusive cross sections of the isovector meson π0π0, the isoscalar mesons ηη and η′(958)η′(958), the strange meson K0SKS0 and the ΛΛ baryon have been measured as functions of scaled energy in hadronic events, two-jet events and each jet of three-jet events from hadronic Z decays and compared to Monte Carlo models. The analysis is based on 3.7 million hadronic events collected with the ALEPH detector at LEP at a centre-of-mass energy of s√=91.2s=91.2 GeV. The JETSET modelling of the gluon fragmentation into isoscalar mesons is found to be in agreement with the experimental results. HERWIG …
Supervised Adaptive Resonance Theory And Rules, Ah-Hwee Tan
Supervised Adaptive Resonance Theory And Rules, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Supervised Adaptive Resonance Theory is a family of neural networks that performs incremental supervised learning of recognition categories (pattern classes) and multidimensional maps of both binary and analog patterns. This chapter highlights that the supervised ART architecture is compatible with IF-THEN rule-based symbolic representation. Specifically, the knowledge learned by a supervised ART system can be readily translated into rules for interpretation. Similarly, a priori domain knowledge in the form of IF-THEN rules can be converted into a supervised ART architecture. Not only does initializing networks with prior knowledge improve predictive accuracy and learning efficiency, the inserted symbolic knowledge can also …
Measurement Of The Z Resonance Parameters At Lep, R. Barate, M. Thulasidas
Measurement Of The Z Resonance Parameters At Lep, R. Barate, M. Thulasidas
Research Collection School Of Computing and Information Systems
The properties of the Z resonance are measured from the analysis of 4.5 million Z decays into fermion pairs collected with the ALEPH detector at LEP. The data are consistent with lepton universality. The resonance parameters are measured to be MZ=(91.1885±0.0031)GeV/c2MZ=(91.1885±0.0031)GeV/c2, ΓZ=(2.4951±0.0043)ΓZ=(2.4951±0.0043) GeV, σ0had=(41.559±0.058)σhad0=(41.559±0.058) nb and, combining the three lepton flavours, Rℓ=20.725±0.039Rℓ=20.725±0.039. The corresponding number of light neutrino species is Nν=2.983±0.013Nν=2.983±0.013 and the strong coupling constant is αs(MZ)=0.114±0.004±0.002QCD+0.005log10[MH150GeV/c2]αs(MZ)=0.114±0.004±0.002QCD+0.005log10[MH150GeV/c2]. The lepton pair forward-backward asymmetry is measured to be A0,ℓFB=0.0173±0.0016AFB0,ℓ=0.0173±0.0016 from which the effective weak mixing angle is derived: sin2θlepteff=0.23089±0.00089sin2θefflept=0.23089±0.00089. The measurement of the leptonic width Γℓℓ=84.02±0.15Γℓℓ=84.02±0.15 MeV leads to a determination …
Measurements Of The Structure Of Quark And Gluon Jets In Hadronic Z Decays, R. Barate, M. Thulasidas
Measurements Of The Structure Of Quark And Gluon Jets In Hadronic Z Decays, R. Barate, M. Thulasidas
Research Collection School Of Computing and Information Systems
An experimental investigation of the structure of identified quark and gluon jets is presented. Observables related to both the global and internal structure of jets are measured; this allows for tests of QCD over a wide range of transverse momentum scales. The observables include distributions of jet-shape variables, the mean and standard deviation of the subjet multiplicity distribution and the fragmentation function for charged particles. The data are compared with predictions of perturbative QCD as well as QCD-based Monte Carlo models. In certain kinematic regions the measurements are sensitive mainly to perturbatively calculable effects, allowing for a test of QCD. …
The Window Distribution Of Multiple Tcps With Random Loss Queues, Archan Misra, Teunis Ott, John Baras
The Window Distribution Of Multiple Tcps With Random Loss Queues, Archan Misra, Teunis Ott, John Baras
Research Collection School Of Computing and Information Systems
Two approximate techniques for analyzing the window size distribution of TCP flows sharing a RED-like bottleneck queue are presented. Both methods presented first use a fixed point algorithm to obtain the mean window sizes of the flows, and the mean queue length in the bottleneck buffer. The simpler of the two methods then uses the ‘square root formula’ for TCP; the other method is more complicated. More often than not, the simpler method is slightly more accurate; this is probably due to the fact that window sizes of the different flows are negatively correlated.
Zbroker: A Query Routing Broker For Z39.50 Databases, Yong Lin, Jian Xu, Ee Peng Lim, Wee-Keong Ng
Zbroker: A Query Routing Broker For Z39.50 Databases, Yong Lin, Jian Xu, Ee Peng Lim, Wee-Keong Ng
Research Collection School Of Computing and Information Systems
A query routing broker is a software agent that determines from a large set of accessing information sources the ones most relevant to a user's information need. As the number of information sources on the Internet increases dramatically, future users will have to rely on query routing brokers to decide a small number of information sources to query without incurring too much query processing overheads. In this paper, we describe a query routing broker known as ZBroker developed for bibliographic database servers that support the Z39.50 protocol. ZBroker samples the content of each bibliographic database by using training queries and …
Mpeg-4 Systems And Applications, Hari Kalva, Lai-Tee Cheok, Alexandros Eleftheriadis
Mpeg-4 Systems And Applications, Hari Kalva, Lai-Tee Cheok, Alexandros Eleftheriadis
Research Collection School Of Computing and Information Systems
MPEG-4, under the auspices of the ISO, is specifying tools to enable object-based audio-visual presentations [3]. These include tools to encode individual objects, compose presentations with objects, store these object-based presentations and access these presentations in a distributed manner over networks. The main distinguishing feature of object-based audio-visual presentations is the scene composition at the user terminal. The objects that are part of a scene are composed and displayed at the user end as opposed to encoding the composed scenes as is done in the case of MPEG-2. Such object-based representation and presentation has several benefits including compression efficiency and …
Design Approaches To Model-Based Simulation In Intelligent Computer Assisted Instruction, Bjoern Helfesrieder, Venky Shankararaman
Design Approaches To Model-Based Simulation In Intelligent Computer Assisted Instruction, Bjoern Helfesrieder, Venky Shankararaman
Research Collection School Of Computing and Information Systems
Model-based simulation systems have been created in various fields of engineering to train personnel or students in operation, maintenance and troubleshooting of complex devices and systems. A review of literature indicates a lack of good overviews of the approaches to system design of model-based training simulations in Intelligent Computer Assisted Instruction (ICAI). Though single systems have to some extent been evaluated with regard to their performance, an organised evaluation, especially a comparative evaluation of the systems that have been created within the field is lacking. To be able to successfully conduct an in-depth review under these conditions, we concentrate and …
Motion Tracking Of Human Mouth By Generalized Deformable Models, Syin Chan, Chong-Wah Ngo, Kok F. Lai
Motion Tracking Of Human Mouth By Generalized Deformable Models, Syin Chan, Chong-Wah Ngo, Kok F. Lai
Research Collection School Of Computing and Information Systems
We propose and evaluate four trackers for tracking the shape, motion and deformation of a human mouth in video sequences. The trackers are suitable for use in very low bitrate video coding systems. (C) 1999 Elsevier Science B.V. All rights reserved.
Wedagen: A Synthetic Web Database Generator, Pallavi Priyardarshini, Fengqiong Qin, Ee Peng Lim, Wee-Keong Ng
Wedagen: A Synthetic Web Database Generator, Pallavi Priyardarshini, Fengqiong Qin, Ee Peng Lim, Wee-Keong Ng
Research Collection School Of Computing and Information Systems
At the Centre for Advanced Information Systems (CAIS), a Web warehousing system is being developed to store and manipulate Web information. The system named WHOWEDA (WareHouse Of WEb DAta) stores extracted Web information as Web tables and provides several Web operators, eg. Web join, Web select, global coupling, etc., to manipulate Web tables. During the implementation of WHOWEDA, it is necessary to perform systematic testing on the system and to evaluate its system performance. While it is possible for WHOWEDA to be tested or evaluated using actual Web pages downloaded from WWW, the amount of time required for such testing …
Research Issues In Web Data Mining, Sanjay Kumar Madria, Sourav S. Bhowmick, Wee-Keong Ng, Ee Peng Lim
Research Issues In Web Data Mining, Sanjay Kumar Madria, Sourav S. Bhowmick, Wee-Keong Ng, Ee Peng Lim
Research Collection School Of Computing and Information Systems
In this paper, we discuss mining with respect to web data referred here as web data mining. In particular, our focus is on web data mining research in context of our web warehousing project called WHOWEDA (Warehouse of Web Data). We have categorized web data mining into threes areas; web content mining, web structure mining and web usage mining. We have highlighted and discussed various research issues involved in each of these web data mining category. We believe that web data mining will be the topic of exploratory research in near future.
Locating Web Information Using Web Checkpoints, Aik Kee Luah, Wee-Keong Ng, Ee Peng Lim, Wee Peng Lee, Yinyan Cao
Locating Web Information Using Web Checkpoints, Aik Kee Luah, Wee-Keong Ng, Ee Peng Lim, Wee Peng Lee, Yinyan Cao
Research Collection School Of Computing and Information Systems
Conventional search engines locate information by letting users establish a single web checkpoint1. By specifying one or more keywords, users direct search engines to return a set of documents that contain those keywords. From the documents (links) returned by search engines, user proceed to further probe the WWW from there. Hence, these initial set of documents (contingent upon the occurrence of keyword(s)) serve as a web checkpoint. Generally, these links are numerous and may not result in much fruitful searches. By establishing multiple web checkpoints, a richer and controllable search procedure can be constructed to obtain more relevant Web information. …
Non-Repudiation In An Agent-Based E-Commerce System, Chin Chuan Liew, Wee-Keong Ng, Ee Peng Lim, Beng Suang Tan, Kok-Leong Ong
Non-Repudiation In An Agent-Based E-Commerce System, Chin Chuan Liew, Wee-Keong Ng, Ee Peng Lim, Beng Suang Tan, Kok-Leong Ong
Research Collection School Of Computing and Information Systems
Abecos is an agent-based e-commerce system under development at the Nanyang Technological University. A key factor in making this system usable in practice is strict security controls. One aspect of security is the provision of non-repudiation services. As protocols for non-repudiation have focused on -message non-repudiation, its adaptation to afford non-repudiation in a communication session for two agents in Abecos is inefficient. In this work, we investigate and propose a protocol for enforcing non-repudiation in a session. The protocol is believed to be applicable in any e-commerce system; agent- or not agent-based.
Cluster-Based Database Selection Techniques For Routing Bibliographic Queries, Jian Xu, Ee Peng Lim, Wee-Keong Ng
Cluster-Based Database Selection Techniques For Routing Bibliographic Queries, Jian Xu, Ee Peng Lim, Wee-Keong Ng
Research Collection School Of Computing and Information Systems
In this paper, we focus on the database selection problem in the context of a global digital library consisting of a large number of online bibliographic servers. Each server hosts a bibliographic database that contains bibliographic records each of which consists of text values for a number of pre-defined bibliographic attributes such as title, author, call number, subject, etc.. Each bibliographic database supports user queries on the bibliographic attributes. Since bibliographic records are relatively small in size, we only consider bibliographic databases that support boolean queries on the bibliographic attributes, and the query results are not ranked. While focusing on …
Detection Of Gradual Transitions Through Temporal Slice Analysis, Chong-Wah Ngo, T. C. Pong, R. T. Chin
Detection Of Gradual Transitions Through Temporal Slice Analysis, Chong-Wah Ngo, T. C. Pong, R. T. Chin
Research Collection School Of Computing and Information Systems
In this paper, we present approaches for detecting camera cuts, wipes and dissolves based on the analysis of spatio-temporal slices obtained from videos. These slices are composed of spatial ly and temporal ly coherent regions which can be perceived as shots. In the proposed methods, camera breaks are located by performing color-texture segmentation and statistical analysis on these video slices. In addition to detecting camera breaks, our methods can classify the detected breaks as camera cuts, wipes and dissolves in an efficient manner
Camera Break Detection By Partitioning Of 2d Spatio-Temporal Images In Mpeg Domain, Chong-Wah Ngo
Camera Break Detection By Partitioning Of 2d Spatio-Temporal Images In Mpeg Domain, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
In this paper, we propose a new approach to detect camera cuts and wipes. The approach projects a video into two images representing the spatio-temporal continuity of a video life. Visually, these images are composed by regions of different patterns, each region represents the temporal location of a shot. The shape of a region boundary inherently classifies cut and wipe, and most importantly, marks the start and end of a wipe sequence. We hence formulate algorithms to locate the color and texture discontinuities occurring at the boundaries of image regions.
Notepals: Lightweight Note Sharing By The Group, For The Group, Richard C. Davis, James A. Landay, Victor Chen, Jonathan Huang, Rebecca B. Lee, Francis Li, James Lin, Charles B. Morrey, Morgan N. Price, Bill N. Schilit
Notepals: Lightweight Note Sharing By The Group, For The Group, Richard C. Davis, James A. Landay, Victor Chen, Jonathan Huang, Rebecca B. Lee, Francis Li, James Lin, Charles B. Morrey, Morgan N. Price, Bill N. Schilit
Research Collection School Of Computing and Information Systems
NotePals is a lightweight note sharing system that gives group members easy access to each others experiences through their personal notes. The system allows notes taken by group members in any context to be uploaded to a shared repository. Group members view these notes with browsers that allow them to retrieve all notes taken in a given context or to access notes from other related notes or documents. This is possible because NotePals records the context in which each note is created (e.g., its author, subject, and creation time). The system is lightweight because it fits easily into group members …
Pi-Web Join In A Web Warehouse, Sourav S. Bhowmick, Sanjay Kumar Madria, Wee-Keong Ng, Ee Peng Lim
Pi-Web Join In A Web Warehouse, Sourav S. Bhowmick, Sanjay Kumar Madria, Wee-Keong Ng, Ee Peng Lim
Research Collection School Of Computing and Information Systems
With the enormous amount of data stored in the World Wide Web, it is increasingly important to design and develop powerful web warehousing tools. The key objective of our web warehousing project, called WHOWEDA (Warehouse of Web Data), is to design and implement a web warehouse that materializes and manages useful information from the Web. In this paper, we introduce the concept of Pi-web join in the context of WHOWEDA. Pi-web join operator is a web information manipulation operator to combine relevant web information residing in two web tables. Informally, it is the combination of web join and web project …
Resource Scheduling In A High-Performance Multimedia Server, Hwee Hwa Pang, Bobby Jose, M. S. Krishnan
Resource Scheduling In A High-Performance Multimedia Server, Hwee Hwa Pang, Bobby Jose, M. S. Krishnan
Research Collection School Of Computing and Information Systems
Supporting continuous media data-such as video and audio-imposes stringent demands on the retrieval performance of a multimedia server. In this paper, we propose and evaluate a set of data placement and retrieval algorithms to exploit the full capacity of the disks in a multimedia server. The data placement algorithm declusters every object over all of the disks in the server-using a time-based declustering unit-with the aim of balancing the disk load. As for runtime retrieval, the quintessence of the algorithm is to give each disk advance notification of the blocks that have to be fetched in the impending time periods, …
The Window Distribution Of Idealized Tcp Congestion Avoidance With Variable Packet Loss, Archan Misra, Teunis J. Ott
The Window Distribution Of Idealized Tcp Congestion Avoidance With Variable Packet Loss, Archan Misra, Teunis J. Ott
Research Collection School Of Computing and Information Systems
This paper analyzes the stationary behavior of the TCP congestion window performing ideal congestion avoidance when the packet loss probability is not constant, but varies as a function of the window size. By neglecting the detailed window behavior during fast recovery, we are able to derive a Markov process that is then approximated by a continuous-time, continuous state space process. The stationary distribution of this process is analyzed and derived numerically and then extrapolated to obtain the stationary distribution of the TCP window. This numerical analysis enables us to predict the behavior of the TCP congestion window when interacting with …