bluuebunny/crossref_metadata_2025 huggingface dataset:
Book Review: Artificial Intelligence and Tutoring Systems: Computational and Cognitive Approaches to the Communication of Knowledge by Eitenne Wenger (Morgan Kaufmann Publishers)
Authors: Bienkowski Marie
Published: January 2007

Upon first encountering Etienne Wenger's book, "Artificial Intelligence and Tutoring Systems: Computational and Cognitive Approaches to the Communication of Knowledge," I assumed that it was the sort of book that would serve only as a reference. To find out about the EXCHECK tutoring system, I would just look it up in the exhaustive subject index. To see what tutoring work Beverly Woolf had done, I would look up her name in the author index. But, upon further examination, Wenger's book was revealed to be a good introductory text, first laying out basic issues in Chapters 1 and 2, then covering systems from SCHOLAR and SOPHIE to GUIDON and ACTP in Chapters 3 through 13. Each review chapter ends with a summary and an excellent set of bibliographic notes, further reinforcing the utility of the book as a reference and introduction to the field. In addition, it became clear that the book had another facet. As John Seely Brown and James Greeno point out in the introduction, "... this book is no mere catalog of programs and techniques... he has also laid out a provocative framework for analyzing and comparing intelligent tutoring systems." This framework is presented in Chapters 14 through 20. Thus, Wenger's book serves three purposes: it acts as a reference, it provides a comprehensive introduction to intelligent tutoring systems, and it develops a coherent framework for thinking about issues in any intelligent system that must communicate its knowledge.
Book review: Artificial Intelligence with Statistical Pattern Recognition by Edward A. Patrick and James M. Fattu (Prentice-Hall Inc.)
Authors: Sallach David L.
Published: January 2007

"Artificial Intelligence with Statistical Pattern Recognition" is a curious and frustrating book. Its authors, Edward A. Patrick and James M. Fattu, repeatedly claim to be making a contribution as fundamental as that of the Rev. Thomas Bayes, yet their level of rhetoric surely obscures the possible contribution of the work. While the authors' intended goal of applying statistical pattern recognition for purposes of inference in complex domains is important, the book has been criticized for being long on hype and short on clarity.
Book review: Machine Learning of Robot Assembly Plans by Arberto Maria Segre (Kluwer Academic Publishers, 1988)
Authors: Bravos Angelo G.
Published: January 2007

This new hard-cover book is the commercialization of a 1987 Ph.D. thesis from the Coordinated Science Lab of University of Illinois entitled "Explanation-Based Learning of Generalized Robot Assembly Plans." In 233 pages the author describes an AI experiment in the form of a computer programs called ARMS (Acquiring Robotic Manufacturing Schemata). ARMS represents the application of Explanation-Based Learning (EBL) to a restricted robot manufacturing domain. In particular, the machine learning technique of generalizing problem-solving knowledge acquired from a single example has been applied to the problem of preparing a robot to perform the novel task of assembling pieces (washers, pegs, and blocks) into well-defined mechanisms.
The creation of digital consciousness
Authors: Monterege J. T.
Published: January 2007

It is possible with the existing computer technology to construct a machine that would be accepted as a fully intelligent and conscious entity.
Magic tooltool interface
Authors: Fretheim Erik , DeGroat J. W.
Published: January 2007

The Air Force Institute of Technology, like many other schools, uses the Berkeley Tool Set for chip layout in VLSI design courses. One of the important tools of this set is the layout editor, MAGIC. Designing at the mask level is one of the important aspects of a VLSI design course, as it allows students to get a feel for what kinds of decisions and design trade-offs must be made in creating a circuit. One of the drawbacks of using a layout editor, such as MAGIC, is the amount of time it takes students to learn the interface to the tool, and the resistance to having to memorize a long list of commands or macros. To overcome this drawback, we have created a graphical user interface using Tooltool.
On the computation of syzygies
Authors: Wall B.
Published: January 2007

This paper deals with the computation of syzygies for a set of polynomials simultaneously with the computation of a Gröbner basis for these polynomials. It is shown that a criterion to avoid unneccessary reductions during the Gröbner basis algorithm can also be used in this case.
Fast algorithm for calculation of Dirac's gamma-matrices traces
Authors: Ilyin V. A. , Kryukov A. P. , Rodioniov A. Y. , Taranov A. Y.
Published: January 2007

This paper describes a fast algorithm for calculation of traces of Dirac's gamma-matrices proposed by Kennedy and Cvitanovich. Comparison with standard REDUCE calculations shows that Kennedy-Cvitanovich algorithm is preferable when space-time dimension exceeds 4.
Comments on the performance of algebra systems in general relativity and a recent paper by Nielsen and Pedersen
Authors: MacCallum M. A.
Published: January 2007

A recent paper by Nielsen and Pedersen [1] reported some calculations on a solution of the Einstein equations for a Euclidean four-dimensional space. A response was recently made by Schrüfer [2]. This further comment sets some of the remarks in a more general context and reports some curious test results of further comparisons.
A T
E
X-REDUCED-Interface
Authors: Antweiler W. , Strotmann A. , Winkelmann V.
Published: January 2007

REDUCE is a well known computer algebra system invented by Anthony C. Hearn. While every effort was made to improve the system's algebraic capabilities, the readability of the output remained poor by modern typesetting standards. Although a pretty-printer is already incorporated in REDUCE, the output is produced only in line-printer quality. The simple idea to produce high quality output from REDUCE is to link REDUCE with Donald E. Knuth's famous TEX typesetting language. This draft reviews our efforts in this direction. Our majors goals we pursue with TRI are:• We want to produce REDUCE-output in typesetting quality.• The interlnediate files (TEX-input files) should be easy to edit. The reason is that it is likely that the proposed line-breaks are sub-optilnal from the user's point of view.• We apply a TEX-like algorithm which "optimizes" the line-breaking over the whole expression. This differs fundamentally from the standard left-to-right, one-line look-ahead pretty-printers of REDUCE, LISP and the like.
An improved algorithm to find the length of the longest common subsequence of two strings
Authors: Kuo S. , Cross G. R.
Published: January 2007

Let
A
and
B
be strings of common length
n.
Define
LLCS
(
A, B
) to be the length of the longest common subsequence of
A
and
B.
Hunt and Szymanski presented an algorithm for finding
LLCS
(
A, B
) with time complexity
O
((
r
+
n
)
logn
), where
r
is the number of elements in the set {(
i, j
)|
A
[
i
] =
B
[
j
]}. In the worst case the algorithm has running time of
O
(
n
2
logn
). We present an improvement to this algorithm which changes the time complexity to
O
(
r
+
n
(
LLCS
(
A, B
) +
logn
)). Some experimental results show dramatic improvements for large
n.
Characterizations of parallelism in applications and their use in scheduling
Authors: Sevcik K. C.
Published: January 2007

As multiprocessors with large numbers of processors become more prevalent, we face the task of developing scheduling algorithms for the multiprogrammed use of such machines. The scheduling decisions must take into account the number of processors available, the overall system load, and the ability of each application awaiting activation to make use of a given number of processors.

The parallelism within an application can be characterized at a number of different levels of detail. At the highest level, it might be characterized by a single parameter (such as the proportion of the application that is sequential, or the average number of processors the application would use if an unlimited number of processors were available). At the lowest level, representing all the parallelism in the application requires the full data dependency graph (which is more information than is practically manageable).

In this paper, we examine the quality of processor allocation decisions under multiprogramming that can be made with several different high-level characterizations of application parallelism. We demonstrate that decisions based on parallelism characterizations with two to four parameters are superior to those based on single-parameter characterizations (such as fraction sequential or average parallelism). The results are based predominantly on simulation, with some guidance from a simple analytic model.
Database privacy
Authors: Olivier Martin S.
Published: January 2007

The emphasis in database privacy should fall on a balance between confidentiality, integrity and availability of personal data, rather than on confidentiality alone. This balance should not necessarily be a trade-off, but should take into account the sensitive nature of the data being stored and attempt to increase all three dimensions to the highest level possible.To achieve such a balance, technological means should be developed.The paper illustrates some of the inherent problems in database privacy that should be addressed by technical solutions. It next demonstrates that the notion of privacy is complex; this complexity is likely to impede development of technical solutions.Finally, the paper finally uses the notion of informed consent to illustrate how the privacy problem can be viewed from multiple angles to flesh out the underlying problems that may be addressed by technical solutions.
Combining data and text mining techniques for yeast gene regulation prediction
Authors: Krogel Mark-A. , Denecke Marcus , Landwehr Marco , Scheffer Tobias
Published: January 2007

In order to solve task 2 of the KDD Cup 2002, we exploited various available information sources. In particular, use of relational information describing the interactions among genes and information automatically extracted from scientific abstracts improves the accuracy of our predictions.
P-tree classification of yeast gene deletion data
Authors: Perera Amal , Denton Anne , Kotala Pratap , Jockheck William , Granda Willy Valdivia , Perrizo William
Published: January 2007

Genomics data has many properties that make it different from "typical" relational data. The presence of multi-valued attributes as well as the large number of null values led us to a P-tree-based bit-vector representation in which matching 1-values were counted to evaluate similarity between genes. Quantitative information such as the number of interactions was also included in the classifier. Interaction information allowed us to extend the known properties of one protein with information on its interacting neighbors. Different feature attributes were weighted independently. Relevance of different attributes was systematically evaluated through optimization of weights using a genetic algorithm. The AROC value for the classified list was used as the fitness function for the genetic algorithm.
Benchmarks for grid computing
Authors: Snavely Allan , Chun Greg , Casanova Henri , Van der Wijngaart Rob F. , Frumkin Michael A.
Published: January 2007

Grid architectures are collections of computational and data storage resources linked by communication channels for shared use. It is important to deploy measurement methods so that Grid applications and architectures can evolve guided by scientific principles. Engineering pursuits need agreed upon metrics---a common language for communicating results, so that alternative implementations can be compared quantitatively. Users of systems need performance parameters that describe system capabilities so that they can develop and tune their applications. Architects need examples of how users will exercise their system to improve the design. The Grid community is building systems such as the TeraGrid [1] and The Informational Power Grid [2] while applications that can fully benefit from such systems are also being developed. We conclude that the time to develop and deploy sets of Grid benchmarks is now. This article reviews fundamental principles, early efforts, and benefits of Grid benchmarks to the study and design of Grids.
A note on two simulation benchmarks
Authors: House Daniel E.
Published: January 2007

This note presents the results of a comparative study done on the popular simulation languages SLAM and GPSS. The models that we tested were executed on a CDC Cyber 750, a multiprogramming system with 377000
8
words of main memory and no virtual memory. A single server queueing model and a multiqueuing model for simulating a token ring local area network were used for the comparison. In addition to SLAM and GPSS, we also develop FORTRAN versions of the models to obtain an idea of how a low level model performs in comparison to a model constructed in a well developed simulation language. The note includes a discussion and some graphical results that may be useful to a modelling practitioner in planning a simulation study.
Heterogeneous product description in electronic commerce
Authors: Ng Wee Keong , Yan Guanghao , Lim Ee-Peng
Published: January 2007

The heterogeneity of product descriptions is an impediment to successful interactions among buyers and vendors in electronic commerce. There is no uniform description even for the same product type among different vendors. In electronic commerce activities involving interactions among different vendors (business-to-business) or between a buyer and vendors (consumer-to-business), a common ontology for products is critical. There are two approaches to resolve the information heterogeneity problem in electronic commerce: standardization and integration. This short paper presents an overview of these approaches and shows that even with standardization efforts, some form of integration would still be required due to the potential multiplicity of standards and their degree of acceptance.
The architecture of a one-stop web-window shop
Authors: Marathe Mona , Diwakar Hemalatha
Published: January 2007

With the advent of e-commerce, web shops - where a potential buyer can make a purchase transaction on the web - are becoming commonplace. In everyday life, as buyers we face a typical need for matching or coordinating a host of articles/services before taking the purchase decision. Very often the articles/services (items) which we seek to buy are marketed by completely different shops/agencies, necessitating visits to different shops. The same situation translated to the web, means that the shopper has to make visits to several different web-sites and evaluate articles before taking the purchase decision. Just as in real life, as a first step the right web-shops have to be identified. Although, a search engine can do this, it would take a smart choice of search words to hit upon the "right" shops. "Right" in terms of the items they trade in and the geographical proximity to the shopper. Next comes the aspect of coordinating the chosen items. Clearly, this is very inconvenient because the various items cannot be compared simultaneously. To facilitate this requirement, what is needed is a Mediator, which provides a functional integration of the Web Shops of interest. Further, given the ubiquity of the requirement, a mediation mechanism, which is not only easy-to-use but also easy-to-create, easy-to-deploy and easy-to-maintain, is required. A novel yet simple mediator architecture is described here for mediating e-commerce sites founded on relational databases. The mechanism has been conceptualized to facilitate transactions in the B2C realm of E-Commerce.
Digital rights management, copyright, and Napster
Authors: Garnett Nic
Published: January 2007

Digital Rights Management technologies in the field of copyright protection should meet four objectives: • give consumers new freedom to enjoy music and other forms of content; • give copyright owners and other value chain participants the means to manage and protect their rights in published works; • implement elements of law, such as copyright exceptions, that ensure that rights are managed in accordance with the public interest; • provide users with the means to manage their legitimate personal rights and interests.We sketch how these goals can be achieved with current technology for peer-to-peer Digital Rights Management (DRM). This technology can ensure the neutrality, security, commercial reliability, and trusted interoperability of applications and services used to protect and manage rights in all forms of information, including creative works protected by copyright. The rapidly evolving area of digital commerce in information requires a framework of commercial trust comparable in scope, and at least as reliable, as the systems of trust that underpin commerce in the physical world.
The fifth International conference on autonomous agents
Authors: Yolum Pinar
Published: January 2007

The fifth international conference on autonomous agents took place in Montreal, Canada from May 28th to June 1st, 2001. The technical program was rich with 13 tutorials, 12 workshops, 42 software demos, 57 papers, and 78 posters. In addition, the conference covered four invited talks, a panel on agents in e-commerce and robotics events. This report summarizes the parts of the technical program related to e-commerce.
Chains of commitment software architecture
Authors: Ervin Rich
Published: January 2007

As eCommerce becomes more competitive and continues to expand into and merge with traditional supply-chain based businesses, a significant competitive advantage can be achieved through improved automation of the commitment process. The "chains of commitments" approach to this problem exploits the fact that a commitment from a vendor is backed up by a chain of commitments from a chain of vendors, a.k.a. the supply chain. This paper presents a high-level architecture to support this automation. It draws heavily on principles of collaborative and value chain analysis as examples, but is applicable to any commitments-based supply chain management approach.
Digital rights management for the online music business
Authors: Kwok Sai Ho
Published: January 2007

Digital rights management has become a pressing concern for the online music business. Existing digital rights management systems are backed by two license management models, the tethered model and the untethered model. These two license management models focus on the management of payments and usage rights. The problems with these models are that the tethered model forces consumers to be online, while the untethered model provides relatively less security to the license residing locally. This paper proposes an enhanced license management model for the online music business, which integrates both models together and thus enables online and offline purchasing.
Interoperability of peer-to-peer file sharing protocols
Authors: Lui Siu Man , Kwok Sai Ho
Published: January 2007

Peer-to-Peer (P2P) file sharing software has brought a hot discussion on P2P file sharing among all businesses. Freenet, Gnutella, and Napster are the three most popular P2P file sharing applications. They use three distinct protocols and these protocols come with different characteristics. In this paper, we discuss the protocols of these P2P file sharing applications, in terms of the methodologies used for peer registry, query and content sharing. In order to maximize the benefit of P2P file sharing application that is to facilitate file sharing among various P2P file sharing applications, we propose a framework to integrate various P2P file sharing protocols using P2P gateway in this paper.
The attraction of personalized service for users in mobile commerce
Authors: Ho Shuk Ying , Kwok Sai Ho
Published: January 2007

There has been a notable increase in consumer use of mobile applications. Consumers begin to adopt mobile commerce applications. In response, firms have been investing billions of dollars in order to enhance the hardware and software platforms for mobile commerce. Consequently, with such large investments, firms are highly motivated to attract new clients and retain their old customers. In the present study, the strategic parameters have been studied in order to determine the ways in which mobile service providers acquire new customers. For the purpose of analysis, the dependent variable is the service subscribers' intention to switch to a new service provider with personalized services. Four main constructs have been studied - the amount and the perceived usefulness of general advertisements, the perceived usefulness and privacy issues about personalized advertisements. This empirical study indicates that all four constructs are significant in affecting the decision by subscribers to change to a new mobile service provider.
A bibliography of temporal, spatial and spatio-temporal data mining research
Authors: Roddick John F. , Spiliopoulou Myra
Published: January 2007

With the growth in the size of datasets, data mining has recently become an important research topic and is receiving substantial interest from both academia and industry. At the same time, a greater recognition of the value of temporal and spatial data has been evident and the first papers looking at the confluence of these two areas are starting to emerge. This short paper provides a few comments on this research and provides a bibliography of relevant research papers investigating temporal, spatial and spatio-temporal data mining.
Discovering data mining
Authors: Hirji Karim K.
Published: January 2007

This paper is a review of the book Discovering Data Mining: From Concept to Implementation -- Peter Cabena, Pablo Hadjinian, Rolf Stadler, Jaap Verhees, and Alessandro Zanasi (New Jersey: Prentice Hall, 195 pp., 1998).
Data mining for hypertext
Authors: Chakrabarti Soumen
Published: January 2007

With over 800 million pages covering most areas of human endeavor, the World-wide Web is a fertile ground for data mining research to make a difference to the effectiveness of information search. Today, Web surfers access the Web through two dominant interfaces: clicking on hyperlinks and searching via keyword queries. This process is often tentative and unsatisfactory. Better support is needed for expressing one's information need and dealing with a search result in more structured ways than available now. Data mining and machine learning have significant roles to play towards this end.In this paper we will survey recent advances in learning and mining problems related to hypertext in general and the Web in particular. We will review the continuum of supervised to semi-supervised to unsupervised learning problems, highlight the specific challenges which distinguish data mining in the hypertext domain from data mining in the context of data warehouses, and summarize the key areas of recent and ongoing research.
Phenomenal data mining
Authors: McCarthy John
Published: January 2007

Phenomenal data mining
finds relations between the data and the phenomena that give rise to data rather than just relations among the data.For example, suppose supermarket cash register data does not identify cash customers. Nevertheless, there really are customers, and these customers are characterized by sex, age, ethnicity, tastes, income distribution, and sensitivity to price changes. A data mining program might be able to identify which baskets of purchases are likely to have been made by the same customers. In this example, the receipts are the data, and the customers are phenomena not directly represented in the data. Once the "baskets" of purchases are grouped by customer, the way is open to infer further phenomena about the customers, e.g. their sex, age, etc.This article concerns what can be inferred by programs about phenomena from data and what facts are relevant to doing this. We work mainly with the supermarket example, but the idea is general.In order to infer phenomena from data, facts about their relations must be supplied. Sometimes these facts can be implicit in the programs that look for the phenomena, but more generality is achieved if the facts are represented as sentences of logic in a
knowledge base
used by the programs. The result of phenomenal data-mining might include an extended database with additional fields on existing relations and new relations. Thus the relations describing supermarket baskets might be extended with a customer field, and new relations about customers and their properties might be introduced.
MobiCom poster
Authors: Dutta Ashutosh , Madhanie Sunil , Chen Wai , Altintas Onur , Schulzrinne Henning
Published: January 2007

In order to ensure proper quality of service for real-time communication in a mobile wireless Internet environment, it is essential to minimize the transient packet loss when the mobile host (MH) is moving between different cells (subnets) within a domain. This paper introduces application layer techniques to achieve fast handoff for real-time (RTP/UDP) multimedia traffic in a SIP-based signaling environment. These techniques are based on standard SIP components such as user agents and proxies and provide a network-independent solution suitable for application service providers.
MobiCom poster
Authors: Pattara-Atikom Wasan , Banerjee Sujata , Krishnamurthy Prashant
Published: January 2007

The existing DCF mode of lEEE 802.11 MAC protocol does not suitable for multimedia and QoS-sensitive applications. In this paper, we proposed a novel mechanism based on Deficit Round Robin to calculate various lengths of IFS to support QoS in Wireless LAN. The preliminary results show that throughput variation, delay and delay variation are reduced without compromising fairness.
MobiCom poster
Authors: Faria Daniel B. , Cheriton David R.
Published: January 2007

After the vulnerabilities found in the WEP protocol, providing secure wireless network access has been shown to be a complicated task. This paper describes the specification of a two-protocol architecture that provides secure, flexible, and convenient Internet access. Mutual authentication between mobile clients and access points is performed using public keys tied to domain names while confidentiality, sender authentication and replay detection are provided on a per-frame basis, using per-client dynamic session keys. Designed for the mobile environment, the architecture also provides users with mobility between networks with different address prefixes.
MobiCom poster
Authors: Banerjee Suman , Mishra Arunesh
Published: January 2007

We define "Secure Space" as an enclosed area within which wireless devices can participate in secure group communication. A device is able to join a secure space group by the virtue of its location within the enclosure. The devices communicate with each other using IEEE 802.11 wireless LAN or other similar wireless access technologies. There are two important aspects of this problem --- (a) determining and authenticating the location of a wireless device at the granularity of a secure space, and (b) defining scalable mechanisms to (re)-distribute a common group key among the device inside the secure space, as new devices enter and existing devices leave the space. We solve the location determination and authentication problem using signal strength based techniques. Results from actual wireless experiments show the feasibility of this scheme. We leverage scalable solutions for secure group communication in other environments to propose a hybrid scheme for the key redistribution problem.
Throughput enhanced wireless in local loop (TWiLL)
Authors: Manoj B. S. , D Christo Frank , Murthy C. Siva Ram
Published: January 2007

Traditionally, voice communication over the local loop has been provided by wired systems. In particular, twisted pair has been the standard means of connection for homes and offices for several years. However in the recent past there has been an increased interest in the use of radio access technologies in local loops. Such systems which are now popular for their ease and low cost of installation and maintenance are called Wireless in Local Loop (WLL) systems. Subscribers' demands for greater capacity has grown over the years especially with the advent of the Internet. Wired local loops have responded to these increasing demands through the use of digital technologies such as ISDN and xDSL. Demands for enhanced data rates are being faced by WLL system operators too, thus entailing efforts towards more efficient bandwidth use. Multi-hop communication has already been studied extensively in Ad hoc network environments and has begun making forays into cellular systems as well. Multi-hop communication has been proven as one of the best ways to enhance throughput in a wireless network. Through this effort we study the issues involved in multi-hop communication in a wireless local loop system and propose a novel WLL architecture called Throughput enhanced Wireless in Local Loop (TWiLL). Through a realistic simulation model we show the tremendous performance improvement achieved by TWiLL over WLL. Traditional pricing schemes employed in single hop wireless networks cannot be applied in TWiLL -- a multi-hop environment. We also propose three novel cost reimbursement based pricing schemes which could be applied in such a multi-hop environment.
Avoiding memory leaks with derived types
Authors: Markus Arjen
Published: January 2007

In this short note a solution is presented for one particular type of memory leak that can occur with derived types. With the advent of Fortran 2X and, before that, the adoption of Technical Report ISO/IEC 15581: 1998(E) (the "allocatable array extension") this solution will be superfluous, nevertheless it seems worthwhile to describe it, as it can solve the problem in the short term.
A review on wireless home network technologies
Authors: Vaxevanakis K. , Zahariadis Th. , Vogiatzis N.
Published: January 2007

Connecting residences to broadband access networks offers an unprecedented opportunity to extend the networking customer base beyond the satiated corporate environment. Yet despite this promising prospect, the market is evolving very tenuously: on one hand, there are numerous industrial consortia and standardization bodies that continue their work on independent and often non-interoperable specifications for residential networks; on the other hand, while there are multiple home PCs and multimedia network-enabled appliances, the majority of the houses can not support sophisticated interconnection, while most consumers are unwilling or cannot afford a large scale home rewiring. Among many competing technologies, wireless networks can resolve the rewiring issue capturing a major percentage of the Home Network market. In this paper, we review the available technologies in the home network area, and provide a comparison of the wireless broadband in-home technologies
UNICOM
Authors: Rowell D. , Dalrymple G. F. , Olsen J.
Published: January 2007

The UNICOM is a communicator for the non-vocal severely motor impaired which is based upon a microprocessor-controlled video display and printer. Its fundamental concept is that it is a single device which can be adapted by simple plugin man/machine interfaces to operate in any of several control strategies: scanning, encoding, or direct selection. Input interface devices, ranging from a single switch to a full keyboard, are selected according to the residual motor capabilities of the user. The input device determines the control strategy.
Temporal knowledge discovery in diabetus mellitus and collagen diseases
Authors: Tsumoto Shusaku
Published: January 2007

One of the important problems of knowledge discovery in medicine is that clinical databases include the large amounts of temporal information. This project aims at extracting temporal knowledge from clinical databases on diabetus mellitus and collagen diseases by using rule induction methods and hidden Markov models. Experimental results show that knowledge which medical experts implicity use for medical expert reasoning are extracted from clinical databases. There are plans for the analysis to be extended to other analysis methods and databases.
Data mining and Chinese medicine
Authors: Leung Josef Siu-wai
Published: January 2007

By using data mining techniques, we are• Searching active ingredients (herbs or chemical compounds) in the effective prescriptions of Chinese medicine for specific diseases;• Identifying Chinese medicine material by their "fingerprints" detected by modern analytical instruments and• identifying the quality criteria of Chinese medicinal products.
Health care fraud investigation using data mining
Authors: Feldens Miguel Artur
Published: January 2007

Development of intelligent information systems applied to health care system in Brazil. Data mining is being used as a tool to provide high level information for hospital administration, as well as to discover regularities. These regularities are tools for the investigation of fraud in the public health care system.
Data mining applied to in vitro fertilization, tumor and diabetic patient data
Authors: Hogl Oliver
Published: January 2007

We currently develop a technology to combine knowledge acquisition from domain experts and data mining thus allowing an easy and focused approach to intelligent knowledge discovery. By enabling the domain expert to enter data mining queries in his/her domain terminology and by returning findings in the same terms as well as measuring the interestingness of findings, user support is provided throughout the knowledge discovery process. In the biomedical area a project on the discovery of interesting dependencies in patient data for the purpose of quality management has been carried out within several clinics. In this sector, data mining precedes confirmative analyses by generating first hypotheses. In addition to that, a number of studies concerning the analysis of medical data, e.g. in the fields of in vitro fertilization, classification of tumors, fusion of sensor data, and diabetic patient profiling have been worked on with local university hospitals. By fusing complex medical data from various Sources and analyzing them, new discoveries, e.g. decision trees for tumors, could be made.
Data mining applications to dermatological diseases, colorectal cancer, diabetes, cardiology and medical audit systems
Authors: Anand Sarabjot Singh
Published: January 2007

Diagnosis of Dermatological Diseases

This project aims to develop tools that would provide doctors with the ability to discover the typical characteristics of certain inflammatory dermatological diseases. It is hoped that this will aid doctors in accurately diagnosing the dermatological disorder, especially between two skin diseases with very similar characteristics such as psoriasis and atopic dermatitis.

Prognostic Models for Colorectal Cancer Patients

The goal of this project is to build a robust prognostic model that will predict length of survival for patients with colorectal cancer. Techniques employed for this purpose include Neural Networks, Case-based reasoning (CBR), Cox's Regression and Regression Tree Induction. Accomplishments have been the development of point estimates of survival from Cox's regression to allow direct comparison of Artificial Intelligence techniques with Cox's results and the development of techniques for building more perspicuous models that are intuitive to medical practitioners.

Pre-empting Complications in Diabetic Patients

Data, provided by Data Retrieval in General Practice, is currently being used to discover common trends that appear among diabetic patients. These trends can then be used to predict complications in a diabetic's life cycle. This will allow patients who are not at risk to be filtered out and those who are at risk to be carefully monitored. Data mining techniques such as Sequential Pattern Discovery are being employed for this purpose.

Risk Assessment in Cardiology

This project has been investigating the use of case-based reasoning and the incorporation of fuzzy logic to provide insight into the understanding of the underlying mechanisms of coronary heart disease. By identifying patients at risk early on, it is easier to stop the progression of this disease. A series of qualitative and quantitative information was gathered from middle aged men, such as weight, blood pressure, body fat and family medical histories over a three year time span, to help identify which factors contribute to coronary heart disease.

Integrating Data Mining into Medical Audit Systems

The aim of this project is to bring Data Mining into mainstream medical audit by integrating it with Medical statistics techniques already in use. This will encourage the practice of Evidence-based medicine, that is becoming a norm in western societies, providing IT support for it. The motivation behind this project is the realization that current Medical statistics techniques fall short of certain objectives and requirements of medical audit.
G-networks with propagating resets via RCAT
Authors: Harrison P. G.
Published: January 2007

Stationary Markovian networks, defined by a collection of cooperating agents, can be solved for their equilibrium state probability distribution by a new compositional method that computes their reversed Markov process, under appropriate conditions. We apply this approach to G-networks with chains of triggers and generalised resets, which have some quite distinct properties from the resets proposed recently.
Towards mean field theory of wireless networks
Authors: Marbukh Vladimir
Published: January 2007

This paper proposes to leverage a large body of results on performance evaluation and optimization of wire-line networks for obtaining relevant results for wireless networks by using mean field approximation based on the "effective" link capacities. We derive mean field equations for the effective link capacities and demonstrate how these capacities can be used for evaluating the throughput regions as a function of the channel model as well as transmission and routing protocols. We also discuss possibility of using mean field approximation for assessing the quality of service as a function of the external demands within the throughput region.
An aggregation-based method for the exact analysis of a class of GI/G/1-type processes
Authors: Riska Alma , Smirni Evgenia , Ciardo Gianfranco
Published: January 2007

We present an aggregation-based algorithm for the exact analysis of Markov chains with GI/G/1-type pattern in their repetitive structure, i.e., chains that exhibit
both
M/G/1-type and GI/M/1-type patterns and cannot be solved with existing techniques. Markov chains with a GI/G/1 pattern result when modeling open systems with faults/repairs that accept jobs from multiple exogenous sources. Our method provides exact computation of the steady state probabilities, and allows computation of performance measures of interest including the system queue length or any of its higher moments, the exact probability of system failures and repairs, and consequently a host of performability measures. Our algorithm also applies to systems that are purely of the M/G/1-type or the GI/M/1-type, or their intersection, i.e., quasi-birth-death processes.
Mixed scheduling disciplines for network flows
Authors: Feng Hanhua , Misra Vishal
Published: January 2007

We introduce a novel method to prove that the FBPS discipline has optimal mean sojourn time and mean slowdown ratio for DHR service time distributions in an M/G/1 queue. We then discuss the problems related to FBPS, and propose a new scheduling discipline to overcome these problems.
Probabilistic logic learning
Authors: De Raedt Luc , Kersting Kristian
Published: January 2007

The past few years have witnessed an significant interest in probabilistic logic learning, i.e. in research lying at the intersection of probabilistic reasoning, logical representations, and machine learning. A rich variety of different formalisms and learning techniques have been developed. This paper provides an introductory survey and overview of the state-of-the-art in probabilistic logic learning through the identification of a number of important probabilistic, logical and learning concepts.
Link mining
Authors: Getoor Lise
Published: January 2007

A key challenge for data mining is tackling the problem of mining richly structured datasets, where the objects are linked in some way. Links among the objects may demonstrate certain patterns, which can be helpful for many data mining tasks and are usually hard to capture with traditional statistical models. Recently there has been a surge of interest in this area, fueled largely by interest in web and hypertext mining, but also by interest in mining social networks, security and law enforcement data, bibliographic citations and epidemiological records.
SPAM on the menu: the practical use of remote messaging in community care
Authors: Cheverst Keith , Clarke Karen , Fitton Dan , Rouncefield Mark , Crabtree Andy , Hemmings Terry
Published: January 2007

This paper presents some early design work of the 'Digital Care' project, developing technologies to assist care in the community for user groups with different support needs. Our focus is on developing a SMS Public Asynchronous Messenger (SPAM) system for SMS messaging to a situated display in hostels for ex-psychiatric patients run by a charitable Trust. Such settings pose both methodological and design challenges. We face the methodological challenge to uncover requirements in such a sensitive domain by using ethnography, cultural probes and user workshops. The design challenge in this care setting is to provide support rather than new forms of dependence, and we report on early experiences of the deployed system.
Web usability and age
Authors: Chadwick-Dias Ann , McNulty Michelle , Tullis Tom
Published: January 2007

We conducted two usability studies that included a total of 49 participants ranging in age from 20 to 82. The goal of Study 1 was to learn whether there were differences in how older adults interact with the Web and whether changes in text size would affect performance. Users completed tasks on a prototype employee/retiree benefits site using various text sizes. We learned that older users (55 years or older) had significantly more difficulty using the Web site than younger users. Text size did not significantly affect performance in any age group. In Study 2 new participants performed the same tasks on a version of the site that was redesigned to address the usability problems encountered by older users in Study 1. The goal was to learn whether we could redesign the prototype to improve the performance of older adults. Performance improved significantly for both older and younger users.
Insights from the aphasia project
Authors: McGrenere Joanna , Davies Rhian , Findlater Leah , Graf Peter , Klawe Maria , Moffatt Karyn , Purves Barbara , Yang Sarah
Published: January 2007

This paper explores a number of HCI research issues in the context of the Aphasia Project, a recently established project on the design of assistive technology for aphasic individuals. Key issues include the problems of achieving effective design and evaluation for a user population with an extremely high degree of variance, and user-centered design for a user population with significant communication impairments. We describe the Aphasia Project and our initial approaches to dealing with these issues. Similar issues arise in many areas of assistive technology, so we expect our paper to be of general interest to the research community.
Designing accessible auditory drag and drop
Authors: Winberg Fredrik , Hellstrom Sten Olof
Published: January 2007

This paper presents an audio-only version of drag and drop. By continuously presenting the information, using auditory zooming at two different levels and absolute positioning of the cursor, a blind user is able to get an overview, locate and interact with a specific object. Two user studies on two different versions have been made in order to get input to the design process and to evaluate the ideas. The results points at the importance of being able to customize the interface and to provide an overview of all interface objects.
Adaptive topology control for wireless Ad hoc networks
Authors: Park Seung-Jong , Sivakumar Raghupathy
Published: January 2007

Topology control in ad-hoc networks is the problem of adjusting the transmission power at network nodes in order to achieve the optimal topology that maximizes network performance. Recently, using effective topology control to optimize energy usage in the network has come into focus in the research community [1, 2]. The common thesis arrived at by existing works is that the transmission range used by mobile nodes should be the minimum required to keep the network connected. We refer to such a topology as the
minimally connected topology
in the rest of the paper. We argue in this work that the minimally connected topology does not always provide the optimal performance in typical ad-hoc networks. We show that in contrast, for typical ad-hoc networks with a few hundred nodes distributed over a few square miles area, the optimal topology is a function of the traffic load.
The MARKOV system of production rules
Authors: Slaby Wolfgang A.
Published: January 2007

It is the goal of this report to present the concept of MARKOV algorithm as a universal translator into Braille, which is applicable to every language and every definition of the respective (Grade 1 or Grade 2) Braille and to which all the language-dependent components are supplied as parameters.This report describes in detail the concept of MARKOV algorithm and attempts to make evident that this concept is an adequate general formalization of the translation process of inkprint into Braille.
Computerized conferencing for the deaf and handicapped
Authors: Turoff Murray
Published: January 2007

This summary paper briefly describes a unique an d relatively new medium for human communication utilizing current computer and communication technology. However, emphasis is placed on the tremendous potential benefits that this form of communication can have for the deaf and physically handicapped since this form of communication eliminates restrictions on communication imposed by lack of mobility or transportation, lack of speech, and requirements of time coincidence among members of a discussion.
Depicting credibility in health care Web sites
Authors: O'Grady Laura
Published: January 2007

Use of the World Wide Web (web) to distribute health care material has steadily increased in recent years. However, potentially detrimental health issues can arise when either accurate information is used inappropriately or when inaccurate information is assumed to be correct and implemented. Causes for this problem include the ease with which anyone can present health care material on the web. A rating system in the form of a graphic seal denoting the source as credible is one way to help the average site user discern the relative quality of information presented at a web site. Preliminary research on the effectiveness of this method has been inconclusive. The research outlined in this document will investigate a rating scheme within the context of a web credibility theoretical framework. The goal is to move towards a means of depicting credibility that is more usable as health information on the web becomes increasingly accessed around the world.
Bring socio-cultural contexts into activities
Authors: Sun Hautong
Published: January 2007

The success of mobile text messaging poses many questions for usability studies. Considering the inherent usability weaknesses of mobile phones such as the small display, poor input methods, the moving environment, and noisy surroundings, this success is hard to explain with traditional usability theories that ignore the social-cultural context. A new framework-cultural usability-is proposed for studying the intriguing processes of how cultural factors and contextual issues affect the consumption of mobile text messaging in contexts of use.