A study of computer attitudes of non-computing students of technical colleges in Brunei Darussalam

Abstract: The study surveyed 268 non-computing students among three technical colleges in Brunei Darussalam. The study validated an existing instrument to measure computer attitudes of non-computing students, and identified factors that contributed to the formation of their attitudes. The findings show that computer experience and educational qualification are associated with students' computer attitudes. In contrast, variables such as gender, age, ownership of a personal computer (PC), geographical location of institution, and prior computer training appeared to have no impact on computer attitudes

computer attitudes
noncomputing students
survey
computer experience
educational qualification
gender
age
personal computer ownership
computer training
educational computing
end user computing
technical colleges


A fundamental investigation into large strain recovery of one-way shape memory alloy wires embedded in flexible polyurethanes

Abstract: Shape memory alloys (SMAs) are being embedded in or externally attached to smart structures because of the large amount of actuation deformation and force that these materials are capable of producing when they are heated. Previous investigations have focused primarily on using single or opposing SMA wires exhibiting the two-way shape memory effect (SME) because of the simplicity with which the repeatable actuation behavior of the structure can be predicted. This repeatable actuation behavior is achieved at the expense of reduced levels of recoverable deformation. Alternatively, many potential smart structure applications will employ multiple SMA wires exhibiting a permanent one-way SME to simplify fabrication and increase the recoverable strains in the structure. To employ the one-way wires, it is necessary to investigate how they affect the recovery of large strains when they are embedded in a structure. In this investigation, the large strain recovery of a one-way SMA wire embedded in a flexible polyurethane is characterized using the novel deformation measurement technique known as digital image correlation. These results are compared with a simple actuation model and a three-dimensional finite element analysis of the structure using the Brinson model for describing the thermomechanical behavior of the SMA. Results indicate that the level of actuation strain in the structure is substantially reduced by the inelastic behavior of the one-way SMA wires, and there are significant differences between the deformations of the matrix material adjacent to the SMA wires and in the region surrounding it. The transformation behavior of the SMA wires was also determined to be volume preserving, which had a significant effect on the transverse strain fields


Bisimulation minimization and symbolic model checking

Abstract: State space minimization techniques are crucial for combating state explosion. A variety of explicit-state verification tools use bisimulation minimization to check equivalence between systems, to minimize components before composition, or to reduce a state space prior to model checking. Experimental results on bisimulation minimization in symbolic model checking contexts, however, are mixed. We explore bisimulation minimization as an optimization in symbolic model checking of invariance properties. We consider three bisimulation minimization algorithms. From each, we produce a BDD-based model checker for invariant properties and compare this model checker to a conventional one based on backwards reachability. Our comparisons, both theoretical and experimental, suggest that bisimulation minimization is not viable in the context of invariance verification, because performing the minimization requires as many, if not more, computational resources as model checking the unminimized system through backwards reachability

bisimulation minimization
symbolic model checking
state space minimization techniques
state explosion
explicit-state verification tools
experimental results
optimization
invariance properties
BDD
binary decision diagram
backwards reachability
invariance verification


A new identification approach for FIR models

Abstract: The identification of stochastic discrete systems disturbed with noise is discussed in this brief. The concept of general prediction error (GPE) criterion is introduced for the time-domain estimate with optimal frequency estimation (OFE) introduced for the frequency-domain estimate. The two estimation methods are combined to form a new identification algorithm, which is called the empirical frequency-domain optimal parameter (EFOP) estimate, for the finite impulse response (FIR) model interfered by noise. The algorithm theoretically provides the global optimum of the model frequency-domain estimate. Some simulation examples are given to illustrate the new identification method

empirical frequency-domain optimal parameter estimate


Remember e-commerce? Yeah, well, it's still here

Abstract: Sandy Kemper, the always outspoken CEO of successful e-commerce company eScout, offers his views on the purported demise of "commerce" in e-commerce, and what opportunities lie ahead for those bankers bold enough to act in a market turned tentative by early excesses


Loop restructuring for data I/O minimization on limited on-chip memory embedded processors

Abstract: In this paper, we propose a framework for analyzing the flow of values and their reuse in loop nests to minimize data traffic under the constraints of limited on-chip memory capacity and dependences. Our analysis first undertakes fusion of possible loop nests intra-procedurally and then performs loop distribution. The analysis discovers the closeness factor of two statements which is a quantitative measure of data traffic saved per unit memory occupied if the statements were under the same loop nest over the case where they are under different loop nests. We then develop a greedy algorithm which traverses the program dependence graph to group statements together under the same loop nest legally to promote maximal reuse per unit of memory occupied. We implemented our framework in Petit, a tool for dependence analysis and loop transformations. We compared our method with one based on tiling of fused loop nest and one based on a greedy strategy to purely maximize reuse. We show that our methods work better than both of these strategies in most cases for processors such as TMS320Cxx, which have a very limited amount of on-chip memory. The improvements in data I/O range from 10 to 30 percent over tiling and from 10 to 40 percent over maximal reuse for JPEG loops

loop restructuring
data I/O minimization
on-chip memory
data traffic
embedded processors
loop fusion
data locality
program dependence graph
Petit
fused loop nest
closeness factor
DSP


Women in computing history

Abstract: Exciting inventions, innovative technology, human interaction, and intriguing politics fill computing history. However, the recorded history is mainly composed of male achievements and involvements, even though women have played substantial roles. This situation is not unusual. Most science fields are notorious for excluding, undervaluing, or overlooking the accomplishments of their female scientists. As Lee points out, it is up to the historians and others to remedy this imbalance. Steps have been taken towards this goal through publishing biographies on women in technology, and through honoring the pioneers with various awards such as the GHC'97 Pioneering Awards, the WITI Hall of Fame, and the AWC Lovelace Award. A few online sites contain biographies of women in technology. However, even with these resources, many women who have contributed significantly to computer science are still to be discovered


International customers, suppliers, and document delivery in a fee-based information service

Abstract: The Purdue University Libraries library fee-based information service, the Technical Information Service (TIS), works with both international customers and international suppliers to meet its customers' needs for difficult and esoteric document requests. Successful completion of these orders requires the ability to verify fragmentary citations; ascertain documents' availability; obtain pricing information; calculate inclusive cost quotes; meet customers' deadlines; accept international payments; and ship across borders. While international orders make tip a small percent of the total workload, these challenging and rewarding orders meet customers' needs and offer continuous improvement opportunities to the staff

Purdue University Libraries fee-based information service


Craigslist: virtual community maintains human touch

Abstract: If it works why change it? This might have been the thought on the minds of dot com executives back when Internet businesses were booming, and most of the Web content was free. Web sites were overflowing with advertisements of every kind and size. Now that dot com principals know better, Web ads are no longer the only path to revenue generation. Community portals, however, never seemed to have many ads to begin with, and their content stayed truer to who they served. Many of them started off as simple places for users to list announcements, local events, want ads, real estate, and mingle with other local users. The author saw the need for San Franciscans to have a place to do all of that for free, without any annoying advertising, and ended up offering much more to his community with the creation of craigslist. "[Polling users] was a good way for us to connect with our members, this is the way to operate successfully in situations like these - your members come first."

virtual community
craigslist
Internet businesses
Web content
revenue generation
community portals
announcements
local events
want ads
real estate
San Francisco Bay community


Differential algebraic systems anew

Abstract: It is proposed to figure out the leading term in differential algebraic systems more precisely. Low index linear systems with those properly stated leading terms are considered in detail. In particular, it is asked whether a numerical integration method applied to the original system reaches the inherent regular ODE without conservation, i.e., whether the discretization and the decoupling commute in some sense. In general one cannot expect this commutativity so that additional difficulties like strong stepsize restrictions may arise. Moreover, abstract differential algebraic equations in infinite-dimensional Hilbert spaces are introduced, and the index notion is generalized to those equations. In particular, partial differential algebraic equations are considered in this abstract formulation


Creating Web-based listings of electronic journals without creating extra work

Abstract: Creating up-to-date listings of electronic journals is challenging due to frequent changes in titles available and in URLs for electronic journal titles. However, many library users may want to browse Web pages which contain listings of electronic journals arranged by title and/or academic disciplines. This case study examines the development of a system which automatically exports data from the online catalog and incorporates it into dynamically-generated Web sites. These sites provide multiple access points for journals, include Web-based interfaces enabling subject specialists to manage the list of titles which appears in their subject area. Because data are automatically extracted from the catalog, overlap in updating titles and URLs is avoided. Following the creation of this system, usage of electronic journals dramatically increased and feedback has been positive. Future challenges include developing more frequent updates and motivating subject specialists to more regularly monitor new titles

Web-based listings
electronic journals
URL
library
technical services
public services partnerships
Web pages
case study
online catalog
Web sites
feedback


A digital fountain approach to asynchronous reliable multicast

Abstract: The proliferation of applications that must reliably distribute large, rich content to a vast number of autonomous receivers motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A digital fountain allows any number of heterogeneous receivers to acquire content with optimal efficiency at times of their choosing. Moreover, no feedback channels are needed to ensure reliable delivery, even in the face of high loss rates. We develop a protocol that closely approximates a digital fountain using two new classes of erasure codes that for large block sizes are orders of magnitude faster than standard erasure codes. We provide performance measurements that demonstrate the feasibility of our approach and discuss the design, implementation, and performance of an experimental system

digital fountain
asynchronous reliable multicast
autonomous receivers
broadcast protocols
multicast protocol
scalable protocol
heterogeneous receivers
optimal efficiency
high loss rates
erasure codes
large block size
performance measurements
experimental system performance
Internet
FEC codes
forward error correction
RS codes
Tornado codes
Luby transform codes
bulk data distribution
IP multicast
simulation results
interoperability
content distribution methods
Reed-Solomon codes
decoder


The development and evaluation of SHOKE2000: the PCI-based FPGA card

Abstract: This paper describes a PCI-based FPGA card, SHOKE2000, which was developed in order to study reconfigurable computing. Since the latest field programmable gate arrays (FPGA) consist of input/output (I/O) configurable blocks as well as internal configurable logic blocks, they not only realize various user logic circuits but also connect with popular I/O standards easily. These features enable FPGA to connect several devices with different interfaces, and thus new reconfigurable systems would be realizable by connecting the FPGA with devices such as digital signal processors (DSP) and analog devices. This paper describes the basic functions of SHOKE2000, which was developed for realizing hybrid reconfigurable systems consisting of FPGA, DSP, and analog devices. We also present application examples of SHOKE2000, including a simple image recognition application, a distributed shared memory computer cluster, and teaching materials for computer education


Will new Palms win laurels.?

Abstract: PalmSource's latest operating system for mobile devices harnesses the ARM architecture to support more powerful business software, but there are concerns over compatibility with older applications

PalmSource
operating system
mobile devices
Palm OS 5.0
ARM architecture
compatibility


Silicon debug of a PowerPC TM microprocessor using model checking

Abstract: When silicon is available, newly designed microprocessors are tested in specially equipped hardware laboratories, where real applications can be run at hardware speeds. However, the large volumes of code being run, plus the limited access to the internal nodes of the chip, make it very difficult to characterize the nature of any failures that occur. We describe how temporal logic model checking was used to quickly characterize a design error exhibited during hardware testing of a PowerPC microprocessor. We outline the conditions under which model checking can efficiently characterize such failures, and show how the particular error we detected could have been revealed early in the design cycle, by model checking a short and simple correctness specification. We discuss the implications of this for verification methodologies over the full design cycle

PowerPC microprocessor
model checking
temporal logic
circuit design error
hardware testing
correctness specification
verification methodologies
Computation Tree Logic
circuit debugging


ECG-gated /sup 18/F-FDG positron emission tomography. Single test evaluation of segmental metabolism, function and contractile reserve in patients with coronary artery disease and regional dysfunction

Abstract: /sup 18/F-fluorodeoxyglucose (/sup 18/F-FDG)-positron emission tomography (PET) provides information about myocardial glucose metabolism to diagnose myocardial viability. Additional information about the functional status is necessary. Comparison of tomographic metabolic PET with data from other imaging techniques is always hampered by some transfer uncertainty and scatter. We wanted to evaluate a new Fourier-based ECG-gated PET technique using a high resolution scanner providing both metabolic and functional data with respect to feasibility in patients with diseased left ventricles. Forty-five patients with coronary artery disease and at least one left ventricular segment with severe hypokinesis or akinesis at biplane cineventriculography were included. A new Fourier-based ECG-gated metabolic /sup 18/F-FDG-PET was performed in these patients. Function at rest and /sup 18/F-FDG uptake were examined in the PET study using a 36-segment model. Segmental comparison with ventriculography revealed a high reliability in identifying dysfunctional segments (>96%). /sup 18/F-FDG uptake of normokinetic/hypokinetic/akinetic segments was 75.4+or-7.5, 65.3+or-10.5, and 35.9+or-15.2% (p<0.001). In segments >or=70% /sup 18/F-FDG uptake no akinesia was observed. No residual function was found below 40% /sup 18/F-FDG uptake. An additional dobutamine test was performed and revealed inotropic reserve (viability) in 42 akinetic segments and 45 hypokinetic segments. ECG-gated metabolic PET with pixel-based Fourier smoothing provides reliable data on regional function. Assessment of metabolism and function makes complete judgement of segmental status feasible within a single study without any transfer artefacts or test-to-test variability. The results indicate the presence of considerable amounts of viable myocardium in regions with an uptake of 40-50% /sup 18/F-FDG

Fourier-based ECG-gated metabolic /sup 18/F-fluorodeoxyglucose-positron emission tomography


Evaluating the complexity of index sets for families of general recursive functions in the arithmetic hierarchy

Abstract: The complexity of index sets of families of general recursive functions is evaluated in the Kleene-Mostowski arithmetic hierarchy

index sets complexity
general recursive functions
arithmetic hierarchy
Kleene-Mostowski arithmetic hierarchy


A note on an axiomatization of the core of market games

Abstract: As shown by Peleg (1993), the core of market games is characterized by nonemptiness, individual rationality, superadditivity, the weak reduced game property, the converse reduced game property, and weak symmetry. It was not known whether weak symmetry was logically independent. With the help of a certain transitive 4-person TU game, it is shown that weak symmetry is redundant in this result. Hence, the core on market games is axiomatized by the remaining five properties, if the universe of players contains at least four members

market game core axiomatization
nonempty games
individual rationality
superadditive games
weak reduced game property
converse reduced game property
weak symmetry
transitive 4-person TU game
redundant


The importance of continuity: a reply to Chris Eliasmith

Abstract: In his reply to Eliasmith (see ibid., vol.11, p.417-26, 2001) Poznanski considers how the notion of continuity of dynamic representations serves as a beacon for an integrative neuroscience to emerge. He considers how the importance of continuity has come under attack from Eliasmith (2001) who claims: (i) continuous nature of neurons is not relevant to the information they process, and (ii) continuity is not important for understanding cognition because the various sources of noise introduce uncertainty into spike arrival times, so encoding and decoding spike trains must be discrete at some level

continuity
dynamic representations
integrative neuroscience
neurons
cognition
uncertainty
spike arrival times
spike trains
cognitive systems
neural nets


Planning linear construction projects: automated method for the generation of earthwork activities

Abstract: Earthworks planning for road construction projects is a complex operation and the planning rules used are usually intuitive and not well defined. An approach to automate the earthworks planning process is described and the basic techniques that are used are outlined. A computer-based system has been developed, initially to help planners use existing techniques more efficiently. With their input, the system has been extended to incorporate a knowledge base and a simulation of the earthworks processes. As well as creating activity sets in a much shorter time, the system has shown that for a real project, the model is able to generate activity sets that are comparable to those generated by a project planner

linear construction projects
earthwork activities
road construction projects
planning rules
earthworks planning process
computer-based system
knowledge base


A portable Auto Attendant System with sophisticated dialog structure

Abstract: An attendant system connects the caller to the party he/she wants to talk to. Traditional systems require the caller to know the full name of the party. If the caller forgets the name, the system fails to provide service for the caller. In this paper we propose a portable Auto Attendant System (AAS) with sophisticated dialog structure that gives a caller more flexibility while calling. The caller may interact with the system to request a phone number by providing just a work area, specialty, surname, or title, etc. If the party is absent, the system may provide extra information such as where he went, when he will be back, and what he is doing. The system is built modularly, with components such as speech recognizer, language model, dialog manager and text-to-speech that can be replaced if necessary. By simply changing the personnel record database, the system can easily be ported to other companies. The sophisticated dialog manager applies many strategies to allow natural interaction between user and system. Functions such as fuzzy request, user repairing, and extra information query, which are not provided by other systems, are integrated into our system. Experimental results and comparisons to other systems show that our approach provides a more user friendly and natural interaction for auto attendant system

attendant system
Auto Attendant System
fuzzy request
clear request
semantic frame
dialog manager
spoken dialog systems
telephone
speech recognizer
telephone-based system


Processing of complexly shaped multiply connected domains in finite element mesh generation

Abstract: Large number of finite element models in modern materials science and engineering is defined on complexly shaped domains, quite often multiply connected. Generation of quality finite element meshes on such domains, especially in cases when the mesh must be 100% quadrilateral, is highly problematic. This paper describes mathematical fundamentals and practical -implementation of a powerful method and algorithm allowing transformation of multiply connected domains of arbitrary geometrical complexity into a set of simple domains; the latter can then be processed by broadly available finite element mesh generators. The developed method was applied to a number of complex geometries, including those arising in analysis of parasitic inductances and capacitances in printed circuit boards. The quality of practical results produced by the method and its programming implementation provide evidence that the algorithm can be applied to other finite element models with various physical backgrounds


Modeling group foraging: individual suboptimality, interference, and a kind of matching

Abstract: A series of agent-based models support the hypothesis that behaviors adapted to a group situation may be suboptimal (or "irrational") when expressed by an isolated individual. These models focus on two areas of current concern in behavioral ecology and experimental psychology: the "interference function" (which relates the intake rate of a focal forager to the density of conspecifics) and the "matching law" (which formalizes the observation that many animals match the frequency of their response to different stimuli in proportion to the reward obtained from each stimulus type). Each model employs genetic algorithms to evolve foraging behaviors for multiple agents in spatially explicit environments, structured at the level of situated perception and action. A second concern of the article is to extend the understanding of both matching and interference per se by modeling at this level

group foraging
individual suboptimality
agent-based models
group situation
suboptimal behavior
isolated individual
behavioral ecology
experimental psychology
interference function
focal forager
matching law
genetic algorithms
multiple agents
spatially explicit environments
situated perception
situated action


Asymptotical stability in discrete-time neural networks

Abstract: In this work, we present a proof of the existence of a fixed point and a generalized sufficient condition that guarantees the stability of it in discrete-time neural networks by using the Lyapunov function method. We also show that for both symmetric and asymmetric connections, the unique attractor is a fixed point when several conditions are satisfied. This is an extended result of Chen and Aihara (see Physica D, vol. 104, no. 3/4, p. 286-325, 1997). In particular, we further study the stability of equilibrium in discrete-time neural networks with the connection weight matrix in form of an interval matrix. Finally, several examples are shown to illustrate and reinforce our theory

asymptotical stability
fixed point
Lyapunov function method
symmetric connections
asymmetric connections
unique attractor
stability
equilibrium stability
connection weight matrix
interval matrix
generalized sufficient condition
discrete-time neural networks


Law librarians' survey: are academic law librarians in decline?

Abstract: The author reports on the results of one extra element in the BIALL/SPTL survey, designed to acquire further information about academic law librarians. The survey has fulfilled the aim of providing a snapshot of the academic law library profession and has examined the concerns that have been raised. Perhaps most importantly, it has shown that more long-term work needs to be done to monitor the situation effectively. We hope that BIALL will take on this challenge and help to maintain the status of academic law librarians and aid them in their work

survey
BIALL/SPTL
academic law library
academic law librarians


Defending against flooding-based distributed denial-of-service attacks: a tutorial

Abstract: Flooding-based distributed denial-of-service (DDoS) attack presents a very serious threat to the stability of the Internet. In a typical DDoS attack, a large number of compromised hosts are amassed to send useless packets to jam a victim, or its Internet connection, or both. In the last two years, it was discovered that DDoS attack methods and tools are becoming more sophisticated, effective, and also more difficult to trace to the real attackers. On the defense side, current technologies are still unable to withstand large-scale attacks. The main purpose of this article is therefore twofold. The first one is to describe various DDoS attack methods, and to present a systematic review and evaluation of the existing defense mechanisms. The second is to discuss a longer-term solution, dubbed the Internet-firewall approach, that attempts to intercept attack packets in the Internet core, well before reaching the victim


A network simplex algorithm with O(n) consecutive degenerate pivots

Abstract: We suggest a pivot rule for the primal simplex algorithm for the minimum cost flow problem, known as the network simplex algorithm. Due to degeneracy, cycling may occur in the network simplex algorithm. The cycling can be prevented by maintaining strongly feasible bases proposed by Cunningham (1976); however, if we do not impose any restrictions on the entering variables, the algorithm can still perform an exponentially long sequence of degenerate pivots. This phenomenon is known as stalling. Researchers have suggested several pivot rules with the following bounds on the number of consecutive degenerate pivots: m, n/sup 2/, k(k + 1)/2, where n is the number of nodes in the network, m is the number of arcs in the network, and k is the number of degenerate arcs in the basis. (Observe that k <or= n.) In this paper, we describe an anti-stalling pivot rule that ensures that the network simplex algorithm performs at most k consecutive degenerate pivots. This rule uses a negative cost augmenting cycle to identify a sequence of entering variables

network simplex algorithm
degenerate pivots
minimum cost flow problem
degeneracy
cycling
stalling
anti-stalling pivot rule
negative cost augmenting cycle


Presenting-a better mousetrap [Leeza outboard video signal processor]

Abstract: Scaling interlaced video to match high-resolution plasma, LCD, and DLP displays is a tough job, but Key Digital's Leeza is zip to the tack. And it's digitally bilingual, too. There's no question that outboard video signal processors like Leeza help overcome the inherent limitations of fixed-pixel displays. Being able to match a native display rate with heavily processed video makes the viewing experience much more enjoyable. But it seemed that 70% of the improvement in image quality came from using a digital interface to the DVD player, as most noise and picture artifacts are introduced in the analog video encoding process

DLP displays
LCD displays
plasma displays
Leeza
outboard video signal processors
fixed-pixel displays
heavily processed video


Well behaved women rarely make history!

Abstract: The author considers women in the history of computer science. Prior to the ENIAC, women were extremely important to the computing business as "computers". Just as women had taken over the tasks as secretaries in the late 1800s with the advent of the typewriter, and in the early 1900s staffing telephone exchanges, so computing relied on women as the "workhorses" of the business

women
history
computer science
ENIAC
business
gender issues


Robust model-order reduction of complex biological processes

Abstract: This paper addresses robust model-order reduction of a high dimensional nonlinear partial differential equation (PDE) model of a complex biological process. Based on a nonlinear, distributed parameter model of the same process which was validated against experimental data of an existing, pilot-scale biological nutrient removal (BNR) activated sludge plant, we developed a state-space model with 154 state variables. A general algorithm for robustly reducing the nonlinear PDE model is presented and, based on an investigation of five state-of-the-art model-order reduction techniques, we are able to reduce the original model to a model with only 30 states without incurring pronounced modelling errors. The singular perturbation approximation balanced truncating technique is found to give the lowest modelling errors in low frequency ranges and hence is deemed most suitable for controller design and other real-time applications

high dimensional nonlinear partial differential equation model

biological nutrient removal activated sludge processes


Fractional motion control: application to an XY cutting table

Abstract: In path tracking design, the dynamic of actuators must be taken into account in order to reduce overshoots appearing for small displacements. A new approach to path tracking using fractional differentiation is proposed with its application on a XY cutting table. It permits the generation of optimal movement reference-input leading to a minimum path completion time, taking into account both maximum velocity, acceleration and torque and the bandwidth of the closed-loop system. Fractional differentiation is used here through a Davidson-Cole filter. A methodology aiming at improving the accuracy especially on checkpoints is presented. The reference-input obtained is compared with spline function. Both are applied to an XY cutting table model and actuator outputs compared

fractional motion control
XY cutting table
path tracking design
actuators
fractional differentiation
minimum path completion time
closed-loop system
Davidson-Cole filter
spline function
optimization


A hybrid-neural network and population learning algorithm approach to solving reliability optimization problem

Abstract: Proposes a hybrid approach integrating a dedicated artificial neural network and population learning algorithm applied to maximising system reliability under cost and technical feasibility constraints. The paper includes a formulation of the system reliability optimisation (SRO) problem and a description of the dedicated neural network trained by applying the population learning algorithm. A solution to the example SRO problem is shown and results of the computational experiment are presented and discussed

hybrid approach
dedicated artificial neural network
population learning algorithm
system reliability
cost constraints
technical feasibility constraints
reliability optimization problem


Ethernet networks: getting down to business

Abstract: While it seems pretty clear that Ethernet has won the battle for the mindshare as the network of choice for the factory floor, there's still a war to be won in implementation as cutting-edge manufacturers begin to adopt the technology on a widespread basis

Ethernet
factory floor
cutting-edge manufacturers
supervisory level


Ultra-high speed positioning control of a gravure engraving unit using a discrete-time two-degree-of-freedom H/sub infinity / control

Abstract: The piezoelectric actuator has high-speed response in comparison with the electro-magnetic actuator. However, it is not easy to achieve both high-speed and high-precision response by feedforward control only because the piezoelectric element has nonlinear properties such as the hysteresis effect. Thus, feedback control is required to achieve good performance. We develop a control design method to achieve both high-speed and high-precision response for piezoelectric actuators using the discrete-time H/sub infinity / control method and the two-degree-of-freedom control scheme. The effectiveness of our proposed method has been shown by simulation and experimental results. The most important contribution of our study is that our method can be directly applied to commercial machines


Design patterns for high availability

Abstract: It is possible to achieve five-nines reliability with everyday commercial-quality hardware and software. The key is the way in which these components are combined. The design of high availability systems is based on a combination of redundant hardware components and software to manage fault detection and correction without human intervention. The author quickly reviews some definitions tied to high availability and fault management, and then goes on to discuss some hardware and software design patterns for fault tolerant systems

hardware reliability
software reliability
high availability systems
redundant hardware components
fault detection
fault correction
software design patterns
checkpointing
software redundancy
fault tolerant systems


Quick media response averts PR disaster

Abstract: Sometimes it's not what you do, but how you do it. After hackers broke the blocking code on the home version of its popular Cyber Patrol Internet filtering software and posted it on the Internet, marketers at Microsystems Software pulled out a playbook of standard crisis management and PR techniques. But the Cyber Patrol PR team including outside PR counsel and the company's outside law firm, used those tools aggressively in order to turn the tide of public and media opinion away from the hackers, who initially were hailed as folk heroes, and in favor of the company's interests, to save the product's and the company's reputations and inherent value. And the entire team managed to move at Internet speed: The crisis was essentially over in about three weeks


Tools for the analysis of dose optimization. I. Effect-volume histogram

Abstract: With the advent of dose optimization algorithms, predominantly for intensity-modulated radiotherapy (IMRT), computer software has progressed beyond the point of being merely a tool at the hands of an expert and has become an active, independent mediator of the dosimetric conflicts between treatment goals and risks. To understand and control the internal decision finding as well as to provide means to influence it, a tool for the analysis of the dose distribution is presented which reveals the decision-making process performed by the algorithm. The internal trade-offs between partial volumes receiving high or low doses are driven by functions which attribute a weight to each volume element. The statistics of the distribution of these weights is cast into an effect-volume histogram (EVH) in analogy to dose-volume histograms. The analysis of the EVH reveals which traits of the optimum dose distribution result from the defined objectives, and which are a random consequence of under- or misspecification of treatment goals. The EVH can further assist in the process of finding suitable objectives and balancing conflicting objectives. If biologically inspired objectives are used, the EVH shows the distribution of local dose effect relative to the prescribed level

dose optimization algorithms
effect-volume histogram
intensity-modulated radiotherapy
dosimetric conflicts
treatment goals
treatment risks
computer software
decision-making process
partial volumes
high doses
low doses
volume element weights
treatment planning
objective function
insufficient target coverage
exponential law
cell survival
one-sided quadratic penalties
quadratic overdose penalty


Application of hybrid models for prediction and optimization of enzyme fermentation process. A comparative study

Abstract: The paper presents a comparison of the biotechnological process prediction and optimization results obtained by using different structure hybrid mathematical models for modeling of the same bioprocess. The hybrid models under investigation consist of the product mass balance equation in which different means - an artificial neural network, fuzzy-neural network and cell age distribution based calculation scheme - are incorporated for modeling the specific biosynthesis rate of a desired product. Experimental data from alpha -amylase laboratory and industrial fermentation processes are used for model parameter identification and the process prediction tests

mathematical models
bioprocess
hybrid models
product mass balance equation
fuzzy-neural network
cell age distribution
biosynthesis rate
enzyme fermentation
industrial processes
optimization
identification


Self-describing Turing machines

Abstract: After a sketchy historical account on the question of self-describeness and self-reproduction, and after discussing the definition of suitable encodings for self-describeness, we give the construction of several self-describing Turing machines, namely self-describing machines with, respectively, 350, 267, 224 and 206 instructions

self-describing Turing machines
self-describeness
self-reproduction
encodings


Design and implementation of a new sliding-mode observer for speed-sensorless control of induction machine

Abstract: In this letter, a new sliding-mode-sensorless control algorithm is proposed for the field-oriented induction machine drive. In the proposed algorithm, the terms containing flux, speed, and rotor time constant, which are common in both current and flux equations, in the current model of the induction machine are estimated by a sliding function. The flux and speed estimation accuracy is guaranteed when the error between the actual current and observed current converges to zero. Hence, the fourth-order system is reduced to two second-order systems, and the speed estimation becomes very simple and robust to the parameter uncertainties. The new approach is verified by simulation and experimental results

speed-sensorless control
induction machine
sliding-mode observer
induction motor drive
sensorless control
flux
speed
rotor time constant
flux equations
current equations
current model
sliding function
speed estimation accuracy
fourth-order system reduction
parameter uncertainties


Bad pixel identification by means of principal components analysis

Abstract: Bad pixels are defined as those pixels showing a temporal evolution of the signal different from the rest of the pixels of a given array. Principal component analysis helps us to understand the definition of a statistical distance associated with each pixels, and using this distance it is possible to identify those pixels labeled as bad pixels. The spatiality of a pixel is also calculated. An assumption about the normality of the distribution of the distances of the pixels is revised. Although the influence on the robustness of the identification algorithm is negligible, the definition of a parameter related with this nonnormality helps to identify those principal components and eigenimages responsible for the departure from a multinormal distribution. The method for identifying the bad pixels is successfully applied to a set of frames obtained from a CCD visible and a focal plane array (FPA) IR camera

bad pixel identification
principal components analysis
temporal evolution
statistical distance
robustness
identification algorithm
eigenimages
multinormal distribution
CCD visible camera
focal plane array
IR camera


Quantum-information processing by nuclear magnetic resonance: Experimental implementation of half-adder and subtractor operations using an oriented spin-7/2 system

Abstract: The advantages of using quantum systems for performing many computational tasks have already been established. Several quantum algorithms have been developed which exploit the inherent property of quantum systems such as superposition of states and entanglement for efficiently performing certain tasks. The experimental implementation has been achieved on many quantum systems, of which nuclear magnetic resonance has shown the largest progress in terms of number of qubits. This paper describes the use of a spin-7/2 as a three-qubit system and experimentally implements the half-adder and subtractor operations. The required qubits are realized by partially orienting /sup 133/Cs nuclei in a liquid-crystalline medium, yielding a quadrupolar split well-resolved septet. Another feature of this paper is the proposal that labeling of quantum states of system can be suitably chosen to increase the efficiency of a computational task

quantum-information processing
nuclear magnetic resonance
half-adder operations
subtractor operations
oriented spin-7/2 system
quantum systems
computational tasks
quantum algorithms
state superposition
entanglement
qubits
three-qubit system
/sup 133/Cs nuclei
liquid-crystalline medium
quadrupolar split well-resolved septet
quantum states
computational task
/sup 133/Cs


Clausal resolution in a logic of rational agency

Abstract: A resolution based proof system for a Temporal Logic of Possible Belief is presented. This logic is the combination of the branching-time temporal logic CTL (representing change over time) with the modal logic KD45 (representing belief). Such combinations of temporal or dynamic logics and modal logics are useful for specifying complex properties of multi-agent systems. Proof methods are important for developing verification techniques for these complex multi-modal logics. Soundness, completeness and termination of the proof method are shown and simple examples illustrating its use are given

resolution based proof system
temporal logic
branching-time temporal logic
CTL
modal logic
KD45
belief
dynamic logics
multi-agent systems
multi-modal logics
rational agents


Editorial system vendors focus on Adobe and the future

Abstract: Looking over the newspaper-system market, we note that the Mac is getting new respect. Adobe InDesign has established itself as a solid alternative to Quark XPress for pagination. Positioning themselves for the long run, developers are gradually shifting to new software architectures

newspaper-system market
Adobe InDesign
pagination
Macintosh
publishing


A fuzzy-soft learning vector quantization for control chart pattern recognition

Abstract: This paper presents a supervised competitive learning network approach, called a fuzzy-soft learning vector quantization, for control chart pattern recognition. Unnatural patterns in control charts mean that there are some unnatural causes for variations in statistical process control (SPC). Hence, control chart pattern recognition becomes more important in SPC. In order to detect effectively the patterns for the six main types of control charts, Pham and Oztemel (1994) described a class of pattern recognizers for control charts based on the learning vector quantization (LVQ) such as LVQ, LVQ2 and LVQ-X etc. In this paper, we propose a new supervised LVQ for control charts based on a fuzzy-soft competitive learning network. The proposed fuzzy-soft LVQ (FS-LVQ) uses a fuzzy relaxation technique and simultaneously updates all neurons. It can increase correct recognition accuracy and also decrease the learning time. Comparisons between LVQ, LVQ-X and FS-LVQ are made


VoIP makeover transforms ugly duckling network

Abstract: Surrey County Council's Swan project is Europe's biggest implementation of voice over IP. Six Wans and countless Lans are are being consolidated into a single network covering 6,000 users at 200 sites. The contract was signed in October 2001 for Pounds 13m over five years and rollout will be completed in May 2003

Surrey County Council
Swan
voice over IP
WAN
LAN


Information access for all: meeting the needs of deaf and hard of hearing people

Abstract: Discusses the nature of deafness and hearing impairments, with particular reference to the impact which the onset of hearing loss presents at various ages. The author goes on to present practical tips for interacting with deaf and hard of hearing clients in various communication contexts, including sightreading, TTY communications, and ASL interpreters. An annotated list of suggested readings is appended

information access
deaf clients
hard of hearing clients
deafness
hearing impairments
communication contexts
sightreading
TTY communications
ASL interpreters


'Virtual Family': an approach to introducing Java programming

Abstract: This paper introduces and discusses Virtual Family (VF): a gender-neutral game-based software that introduces Java programming. VF provides a completely functioning game that students extend and enhance via programming. We discuss the background and context within which Virtual Family was developed and other available multimedia resources for teaching programming. The paper then goes on to describe Virtual Family's concept and design. Finally, feedback received from Virtual Family teaching workshops is related, as well as preliminary results from using VF in high-school teaching units. Virtual Family is under development in a research lab at the University of British Columbia and is an initiative of Supporting Women in Information Technology (SWIFT). SWIFT is a five-year research action and implementation project to increase the participation of women in information technology


Genetic algorithm-neural network estimation of Cobb angle from torso asymmetry in scoliosis

Abstract: Scoliosis severity, measured by the Cobb angle, was estimated by artificial neural network from indices of torso surface asymmetry using a genetic algorithm to select the optimal set of input torso indices. Estimates of the Cobb angle were accurate within 5 degrees in two-thirds, and within 10 degrees in six-sevenths, of a test set of 115 scans of 48 scoliosis patients, showing promise for future longitudinal studies to detect scoliosis progression without use of X-rays

Cobb angle
artificial neural network
torso surface asymmetry
genetic algorithm
input torso indices
scoliosis patients
scoliosis progression


The role and future of subject classification: the exploitation of resources

Abstract: It is imperative that the library information systems (LIS) profession and LIS educators appreciate fully the contribution that classification makes to the discipline and that it is no longer seen as the domain of the academic, isolated theorist, but becomes an integral part of our understanding of the contribution that the LIS community can make to society as a whole - as well as to particular areas such as legal information

subject classification
library information systems
LIS
information resources
legal information


IT challenge: cross selling [finance]

Abstract: Like most financial institutions, FleetBoston, Fidelity and Berkshire Group of Companies are being charged with developing a strong technology platform that will allow them to cross sell their products and services. They discuss their solutions, advice and technology choices

cross selling
financial institutions
FleetBoston
Fidelity
Berkshire Group


Noise and the PSTH response to current transients: II. Integrate-and-fire model with slow recovery and application to motoneuron data

Abstract: For pt.I see ibid., vol.11, no.2 , p.135-151( 2001). A generalized version of the integrate-and-fire model is presented that qualitatively reproduces firing rates and membrane trajectories of motoneurons. The description is based on the spike-response model and includes three different time constants: the passive membrane time constant, a recovery time of the input conductance after each spike, and a time constant of the spike afterpotential. The effect of stochastic background input on the peristimulus time histogram (PSTH) response to spike input is calculated analytically. Model results are compared with the experimental data of Poliakov et al. (1996). The linearized theory shows that the PSTH response to an input spike is proportional to a filtered version of the postsynaptic potential generated by the input spike. The shape of the filter depends on the background activity. The full nonlinear theory is in close agreement with simulated PSTH data

PSTH
integrate-and-fire model
firing rates
membrane trajectories
spike-response model
passive membrane time constant
recovery time
spike afterpotential
motoneuron


Convergence of Runge-Kutta methods for nonlinear parabolic equations

Abstract: We study time discretizations of fully nonlinear parabolic differential equations. Our analysis uses the fact that the linearization along the exact solution is a uniformly sectorial operator. We derive smooth and nonsmooth-data error estimates for the backward Euler method, and we prove convergence for strongly A (v)-stable Runge-Kutta methods. For the latter, the order of convergence for smooth solutions is essentially determined by the stage order of the method. Numerical examples illustrating the convergence estimates are presented


Angular disparity in ETACT scintimammography

Abstract: Emission tuned aperture computed tomography (ETACT) has been previously shown to have the potential for the detection of small tumors (<1 cm) in scintimammography. However, the optimal approach to the application of ETACT in the clinic has yet to be determined. Therefore, we sought to determine the effect of the angular disparity between the ETACT projections on image quality through the use of a computer simulation. A small, spherical tumor of variable size (5, 7.5 or 10 mm) was placed at the center of a hemispherical breast (15 cm diameter). The tumor to nontumor ratio was either 5:1 or 10:1. The detector was modeled to be a gamma camera fitted with a 4-mm-diam pinhole collimator. The pinhole-to-detector and the pinhole-to-tumor distances were 25 and 15 cm, respectively. A ray tracing technique was used to generate three sets of projections (10 degrees , 15 degrees , and 20 degrees , angular disparity). These data were blurred to a resolution consistent with the 4 mm pinhole. The TACT reconstruction method was used to reconstruct these three image sets. The tumor contrast and the axial spatial resolution was measured. Smaller angular disparity led to an improvement in image contrast but at a cost of degraded axial spatial resolution. The improvement in contrast is due to a slight improvement in the in-plane spatial resolution. Since improved contrast should lead to better tumor detectability, smaller angular disparity should be used. However, the difference in contrast between 10 degrees and 15 degrees was very slight and therefore a reasonable clinical choice for angular disparity is 15 degrees

emission tuned aperture computed tomography scintimammography

tuned aperture computed tomography reconstruction method


Design and implementation of a reusable and extensible HL7 encoding/decoding framework

Abstract: The Health Level Seven (HL7), an international standard for electronic data exchange in all health care environments, enables disparate computer applications to exchange key sets of clinical and administrative information. Above all, it defines the standard HL7 message formats prescribed by the standard encoding rules. In this paper, we propose a flexible, reusable, and extensible HL7 encoding and decoding framework using a message object model (MOM) and message definition repository (MDR). The MOM provides an abstract HL7 message form represented by a group of objects and their relationships. It reflects logical relationships among the standard HL7 message elements such as segments, fields, and components, while enforcing the key structural constraints imposed by the standard. Since the MOM completely eliminates the dependency of the HL7 encoder and decoder on platform-specific data formats, it makes it possible to build the encoder and decoder as reusable standalone software components, enabling the interconnection of arbitrary heterogeneous hospital information systems (HIS) with little effort. Moreover, the MDR, an external database of key definitions for HL7 messages, helps make the encoder and decoder as resilient as possible to future modifications of the standard HL7 message formats. It is also used by the encoder and decoder to perform a well-formedness check for their respective inputs (i.e., HL7 message objects expressed in the MOM and encoded HL7 message strings). Although we implemented a prototype version of the encoder and decoder using JAVA, they can be easily packaged and delivered as standalone components using the standard component frameworks


Fast accurate MEG source localization using a multilayer perceptron trained with real brain noise

Abstract: Iterative gradient methods such as Levenberg-Marquardt (LM) are in widespread use for source localization from electroencephalographic (EEG) and magnetoencephalographic (MEG) signals. Unfortunately, LM depends sensitively on the initial guess, necessitating repeated runs. This, combined with LM's high per-step cost, makes its computational burden quite high. To reduce this burden, we trained a multilayer perceptron (MLP) as a realtime localizer. We used an analytical model of quasistatic electromagnetic propagation through a spherical head to map randomly chosen dipoles to sensor activities according to the sensor geometry of a 4D Neuroimaging Neuromag-122 MEG system, and trained a MLP to invert this mapping in the absence of noise or in the presence of various sorts of noise such as white Gaussian noise, correlated noise, or real brain noise. A MLP structure was chosen to trade off computation and accuracy. This MLP was trained four times, with each type of noise. We measured the effects of initial guesses on LM performance, which motivated a hybrid MLP-start-LM method, in which the trained MLP initializes LM. We also compared the localization performance of LM, MLPs, and hybrid MLP-start-LMs for realistic brain signals. Trained MLPs are much faster than other methods, while the hybrid MLP-start-LMs are faster and more accurate than fixed-4-start-LM. In particular, the hybrid MLP-start-LM initialized by a MLP trained with the real brain noise dataset is 60 times faster and is comparable in accuracy to random-20-start-LM, and this hybrid system (localization error: 0.28 cm, computation time: 36 ms) shows almost as good performance as optimal-1-start-LM (localization error: 0.23 cm, computation time: 22 ms), which initializes LM with the correct dipole location. MLPs trained with noise perform better than the MLP trained without noise, and the MLP trained with real brain noise is almost as good an initial guesser for LM as the correct dipole location

MEG source localization
fast accurate localization
multilayer perceptron
real brain noise
real-time localizer
analytical model
quasistatic electromagnetic propagation
spherical head
white Gaussian noise
correlated noise
computation accuracy
Levenberg-Marquardt method
iterative gradient methods
forward model


The cataloger's workstation revisited: utilizing Cataloger's Desktop

Abstract: A few years into the development of Cataloger's Desktop, an electronic cataloging tool aggregator available through the Library of Congress, is an opportune time to assess its impact on cataloging operations. A search for online cataloging tools on the Internet indicates a proliferation of cataloging tool aggregators; which provide access to online documentation related to cataloging practices and procedures. Cataloger's Desktop stands out as a leader among these aggregators. Results of a survey to assess 159 academic ARL and large public libraries' reasons for use or non-use of Cataloger's Desktop highlight the necessity of developing strategies for its successful implementation including training staff, providing documentation, and managing technical issues

Cataloger's Desktop
electronic cataloging tool
online cataloging tools
Internet
cataloging tool aggregators
online documentation
large public libraries
academic ARL
staff training
documentation
managing technical issues
cataloger's workstation


Comparison between discrete STFT and wavelets for the analysis of power quality events

Abstract: This paper deals with the comparison of signal processing tools for power quality analysis. Two signal processing techniques are considered: the wavelet filters and the discrete short-time Fourier transforms (STFT). Then, examples of the two most frequent disturbances met in the power system are chosen. An adjustable speed drive with a six-pulse converter using EMTP/ATP is designed and normal energizing of utility capacitors is presented . The analysis is tested on a system consisting of 13 buses and is representative of a medium-sized industrial plant. Finally, each kind of electrical disturbance is analyzed with examples representing each tool. A qualitative comparison of results shows the advantages and drawbacks of each signal processing technique applied to power quality analysis

discrete STFT
wavelets
power quality events
signal processing tools
signal processing techniques
wavelet filters
discrete short-time Fourier transforms
adjustable speed drive
six-pulse converter
EMTP/ATP
utility capacitors
medium-sized industrial plant
electrical disturbance
short-time Fourier transforms


Why information departments are becoming academic

Abstract: This article outlines the increasing convergence between academia and business over the last decade or so, and the mutual benefits that this closer association has brought. It also looks at the growing importance of the information profession, suggesting that this is leading to a greater need for specialist skills, as reflected by the rise in academic courses in this area. However, it argues that increasing specialization must not lead to insularity; if information professionals are truly concerned with gaining a competitive advantage, they must not close their minds to the potential benefits of working with external, non specialist, partners. The benefits that business has reaped from academia, it is contended, suggest that this may also be a fruitful avenue for information departments to explore

information science
universities
academia
business
information profession
specialist skills
academic courses
information departments


Technology decisions 2002

Abstract: The paper looks at the critical hardware, software, and services choices manufacturers are making as they begin to emerge from the recession and position themselves for the future

manufacturing industries
information technology
management of change
customer relationship management
services choices
enterprise resource planning


Bigger is better: the influence of physical size on aesthetic preference judgments

Abstract: The hypothesis that the physical size of an object can influence aesthetic preferences was investigated. In a series of four experiments, participants were presented with pairs of abstract stimuli and asked to indicate which member of each pair they preferred. A preference for larger stimuli was found on the majority of trials using various types of stimuli, stimuli of various sizes, and with both adult and 3-year-old participants. This preference pattern was disrupted only when participants had both stimuli that provided a readily accessible alternative source of preference-evoking information and sufficient attentional resources to make their preference judgments

aesthetic preference judgments
physical size influence
decision making
preference formation
judgment cues
abstract stimuli
adult participants
child participants
preference pattern
preference-evoking information
attentional resources


On fuzzy and probabilistic control charts

Abstract: In this article, different procedures of constructing control charts for linguistic data, based on fuzzy and probability theory, are discussed. Three sets of membership functions, with different degrees of fuzziness, are proposed for fuzzy approaches. A comparison between fuzzy and probability approaches, based on the Average Run Length and samples under control, is conducted for real data. Contrary to the conclusions of Raz and Wang (1990) the choice of degree of fuzziness affected the sensitivity of control charts

linguistic data
fuzzy control charts
probabilistic control charts
control chart construction
membership functions
fuzziness degree
average run length
sensitivity
fuzzy subsets
porcelain products


Numerical modeling of the flow in stenosed coronary artery. The relationship between main hemodynamic parameters

Abstract: The severity of coronary arterial stenosis is usually measured by either simple geometrical parameters, such as percent diameter stenosis, or hemodynamically based parameters, such as the fractional flow reserve (FFR) or coronary flow reserve (CFR). The present study aimed to establish a relationship between actual hemodynamic conditions and the parameters that define stenosis severity in the clinical setting. We used a computational model of the blood flow in a vessel with a blunt stenosis and an autoregulated vascular bed to simulate a stenosed blood vessel. A key point in creating realistic simulations is to properly model arterial autoregulation. A constant flow regulation mechanism resulted in CFR and FFR values that were within the physiological range, while a constant wall-shear stress model yielded unrealistic values. The simulation tools developed in the present study may be useful in the clinical assessment of single and multiple stenoses by means of minimally invasive methods

numerical modeling
hemodynamic parameters
coronary arterial stenosis
stenosis severity
clinical setting
computational model
blood flow
blunt stenosis
autoregulated vascular bed
simulation
stenosed blood vessel
arterial autoregulation
constant flow regulation mechanism
physiological range
constant wall shear stress model
minimally invasive methods


Two efficient algorithms for the generalized maximum balanced flow problem

Abstract: Minoux (1976) considered the maximum balanced flow problem, i.e. the problem of finding a maximum flow in a two-terminal network N = (V,A) with source s and sink t satisfying the constraint that any arc-flow of N is bounded by a fixed proportion of the total flow value from s to t, where V is vertex set and A is arc set. As a generalization, we focus on the problem of maximizing the total flow value of a generalized flow in N with gains gamma (a) > 0 (a in A) where any arc-flow is bounded by a fixed proportion of the total flow value, where gamma (a)f(a) units arrive at the vertex w for each arc-flow f(a) (a identical to ( upsilon , w) in A) entering vertex upsilon in a generalized flow. Our main results are to propose two polynomial algorithms for this problem. The first algorithm runs in O(mM(n, m, B') log B) time, where B is the maximum absolute value among integral values used by an instance of the problem, and M(n, m, B') denotes the complexity of solving a generalized maximum flow problem in a network with n vertices, and m arcs, and a rational instance expressed with integers between 1 and B'. In the second algorithm, using a parameterized technique, runs in O({M(n, m, B')}/sup 2/) time


Williams nears end of Chapter 11 [telecom]

Abstract: Leucadia National Corp. comes through with a $330 million boost for Williams Communications, which should keep the carrier afloat through the remainder of its bankruptcy

Leucadia National Corp
Williams Communications
bankruptcy


Cataloguing to help law library users

Abstract: The author takes a broader view of the catalogue than is usual; we can include within it items that have locations other than the office/library itself. This may well start with Internet resources, but can perfectly appropriately continue with standard works not held in the immediate collection but available in some other accessible collection, such as the local reference library. The essential feature is to include entries for the kind of material sought by users, with the addition of a location mark indicating where they can find it

law library users
cataloguing
Internet resources
reference library
location mark


A question of perspective: assigning Library of Congress subject headings to classical literature and ancient history

Abstract: This article explains the concept of world view and shows how the world view of cataloguers influences the development and assignment of subject headings to works about other cultures and civilizations, using works from classical literature and ancient history as examples. Cataloguers are encouraged to evaluate the headings they assign to works in classical literature and ancient history in terms of the world views of Ancient Greece and Rome so that headings reflect the contents of the works they describe and give fuller expression to the diversity of thoughts and themes that characterize these ancient civilizations

Library of Congress subject heading assignment


Intelligent optimal sieving method for FACTS device control in multi-machine systems

Abstract: A multi-target oriented optimal control strategy for FACTS devices installed in multi-machine power systems is presented in this paper, which is named the intelligent optimal sieving control (IOSC) method. This new method divides the FACTS device output region into several parts and selects one typical value from each part, which is called output candidate. Then, an intelligent optimal sieve is constructed, which predicts the impacts of each output candidate on a power system and sieves out an optimal output from all of the candidates. The artificial neural network technologies and fuzzy methods are applied to build the intelligent sieve. Finally, the real control signal of FACTS devices is calculated according to the selected optimal output through inverse system method. Simulation has been done on a three-machine power system and the results show that the proposed IOSC controller can effectively attenuate system oscillations and enhance the power system transient stability

power system transient stability enhancement


Applied ethics in business information units

Abstract: The primary thesis of this paper is that business information professionals commonly overlook ethical dilemmas in the workplace. Although the thesis remains unproven, the author highlights, by way of real and hypothetical case studies, a number of situations in which ethical tensions can be identified, and suggests that information professionals need to be more aware of the moral context of their actions. Resolving ethical dilemmas should be one of the aims of competent information professionals and their managers, although it is recognized that dilemmas often cannot easily be resolved. A background to the main theories of applied ethics forms the framework for later discussion

business information professionals
ethical dilemmas
moral context
applied ethics
business information units


Moving into the mainstream [product lifecycle management]

Abstract: Product lifecycle management (PLM) is widely recognised by most manufacturing companies, as manufacturers begin to identify and implement targeted projects intended to deliver return-on investment in a timely fashion. Vendors are also releasing second-generation PLM products that are packaged, out-of-the-box solutions

product lifecycle management
manufacturing companies
product data management
product development
enterprise resource planning


Computing transient gating charge movement of voltage-dependent ion channels

Abstract: The opening of voltage-gated sodium, potassium, and calcium ion channels has a steep relationship with voltage. In response to changes in the transmembrane voltage, structural movements of an ion channel that precede channel opening generate a capacitative gating current. The net gating charge displacement due to membrane depolarization is an index of the voltage sensitivity of the ion channel activation process. Understanding the molecular basis of voltage-dependent gating of ion channels requires the measurement and computation of the gating charge, Q. We derive a simple and accurate semianalytic approach to computing the voltage dependence of transient gating charge movement (Q-V relationship) of discrete Markov state models of ion channels using matrix methods. This approach allows rapid computation of Q-V curves for finite and infinite length step depolarizations and is consistent with experimentally measured transient gating charge. This computational approach was applied to Shaker potassium channel gating, including the impact of inactivating particles on potassium channel gating currents

transient gating charge movement
transmembrane voltage
gating current
action potentials
ion channels
charge movement
inactivation
immobilization
Markov state model


Abundance of mosaic patterns for CNN with spatially variant templates

Abstract: This work investigates the complexity of one-dimensional cellular neural network mosaic patterns with spatially variant templates on finite and infinite lattices. Various boundary conditions are considered for finite lattices and the exact number of mosaic patterns is computed precisely. The entropy of mosaic patterns with periodic templates can also be calculated for infinite lattices. Furthermore, we show the abundance of mosaic patterns with respect to template periods and, which differ greatly from cases with spatially invariant templates

mosaic patterns
CNN
spatially variant templates
one-dimensional cellular neural network
infinite lattices
finite lattices
boundary conditions
spatial entropy
transition matrix


Mammogram synthesis using a 3D simulation. II. Evaluation of synthetic mammogram texture

Abstract: We have evaluated a method for synthesizing mammograms by comparing the texture of clinical and synthetic mammograms. The synthesis algorithm is based upon simulations of breast tissue and the mammographic imaging process. Mammogram texture was synthesized by projections of simulated adipose tissue compartments. It was hypothesized that the synthetic and clinical texture have similar properties, assuming that the mammogram texture reflects the 3D tissue distribution. The size of the projected compartments was computed by mathematical morphology. The texture energy and fractal dimension were also computed and analyzed in terms of the distribution of texture features within four different tissue regions in clinical and synthetic mammograms. Comparison of the cumulative distributions of the mean features computed from 95 mammograms showed that the synthetic images simulate the mean features of the texture of clinical mammograms. Correlation of clinical and synthetic texture feature histograms, averaged over all images, showed that the synthetic images can simulate the range of features seen over a large group of mammograms. The best agreement with clinical texture was achieved for simulated compartments with radii of 4-13.3 mm in predominantly adipose tissue regions, and radii of 2.7-5.33 and 1.3-2.7 mm in retroareolar and dense fibroglandular tissue regions, respectively

mammogram synthesis
3D simulation
synthetic mammogram texture
breast tissue simulation
adipose tissue compartments
3D tissue distribution
mathematical morphology
fractal dimension
cumulative distributions
synthetic images
dense fibroglandular tissue regions
retroareolar tissue regions
X-ray image acquisition
computationally compressed phantom


Evaluation of existing and new feature recognition algorithms. 2. Experimental results

Abstract: For pt.1 see ibid., p.839-851. This is the second of two papers investigating the performance of general-purpose feature detection techniques. The first paper describes the development of a methodology to synthesize possible general feature detection face sets. Six algorithms resulting from the synthesis have been designed and implemented on a SUN Workstation in C++ using ACIS as the geometric modelling system. In this paper, extensive tests and comparative analysis are conducted on the feature detection algorithms, using carefully selected components from the public domain, mostly from the National Design Repository. The results show that the new and enhanced algorithms identify face sets that previously published algorithms cannot detect. The tests also show that each algorithm can detect, among other types, a certain type of feature that is unique to it. Hence, most of the algorithms discussed in this paper would have to be combined to obtain complete coverage


Help-desk support is key to wireless success [finance]

Abstract: A well thought out help desk can make or break an institution's mobile play. Schwab, Ameritrade and RBC are taking their support function seriously

finance
help desk
Schwab
Ameritrade
RBC
wireless


Modeling cutting temperatures for turning inserts with various tool geometries and materials

Abstract: Temperatures are of interest in machining because cutting tools often fail by thermal softening or temperature-activated wear. Many models for cutting temperatures have been developed, but these models consider only simple tool geometries such as a rectangular slab with a sharp corner. This report describes a finite element study of tool temperatures in cutting that accounts for tool nose radius and included angle effects. A temperature correction factor model that can be used in the design and selection of inserts is developed to account for these effects. A parametric mesh generator is used to generate the finite element models of tool and inserts of varying geometries. The steady-state temperature response is calculated using NASTRAN solver. Several finite element analysis (FEA) runs are performed to quantify the effects of inserts included angle, nose radius, and materials for the insert and the tool holder on the cutting temperature at the insert rake face. The FEA results are then utilized to develop a temperature correction factor model that accounts for these effects. The temperature correction factor model is integrated with an analytical temperature model for rectangular inserts to predict cutting temperatures for contour turning with inserts of various shapes and nose radii. Finally, experimental measurements of cutting temperature using the tool-work thermocouple technique are performed and compared with the predictions of the new temperature model. The comparisons show good agreement

cutting temperature model
turning inserts
machining
tool nose radius
parametric mesh generator
finite element models
temperature correction factor
insert shape effects
tool geometries


Network-centric systems

Abstract: The author describes a graduate-level course that addresses cutting-edge issues in network-centric systems while following a more traditional graduate seminar format

network-centric systems
graduate level course


A linear time special case for MC games

Abstract: MC games are infinite duration two-player games played on graphs. Deciding the winner in MC games is equivalent to the the modal mu-calculus model checking. In this article we provide a linear time algorithm for a class of MC games. We show that, if all cycles in each strongly connected component of the game graph have at least one common vertex, the winner can be found in linear time. Our results hold also for parity games, which are equivalent to MC games

linear time special case
MC games
two-player games
modal mu-calculus model checking
linear time algorithm


A novel genetic algorithm for the design of a signed power-of-two coefficient quadrature mirror filter lattice filter bank

Abstract: A novel genetic algorithm (GA) for the design of a canonical signed power-of-two (SPT) coefficient lattice structure quadrature mirror filter bank is presented. Genetic operations may render the SPT representation of a value noncanonical. A new encoding scheme is introduced to encode the SPT values. In this new scheme, the canonical property of the SPT values is preserved under genetic operations. Additionally, two new features that drastically improve the performance of our GA are introduced. (1) An additional level of natural selection is introduced to simulate the effect of natural selection when sperm cells compete to fertilize an ovule; this dramatically improves the offspring survival rate. A conventional GA is analogous to intracytoplasmic sperm injection and has an extremely low offspring survival rate, resulting in very slow convergence. (2) The probability of mutation for each codon of a chromosome is weighted by the reciprocal of its effect. Because of these new features, the performance of our new GA outperforms conventional GAs

signed power-of-two coefficient lattice structure


Place/Transition Petri net evolutions: recording ways, analysis and synthesis

Abstract: Four semantic domains for Place/Transition Petri nets and their relationships are considered. They are monoids of respectively: firing sequences, processes, traces and dependence graphs. For each of them the analysis and synthesis problem is stated and solved. The monoid of processes is defined in a non-standard way, Nets under consideration involve weights of arrows and capacities (finite or infinite) of places. However, the analysis and synthesis tasks require nets to be pure, i.e. each of their transition must have the pre-set and post-set disjoint

place/transition Petri net evolutions
semantic domains
monoids
firing sequences
dependence graphs
post-set disjoint
pre-set disjoint


Trading exchanges: online marketplaces evolve

Abstract: Looks at how trading exchanges are evolving rapidly to help manufacturers keep up with customer demand

online marketplaces
trading exchanges
manufacturers
customer demand
enterprise platforms
supply chain management
enterprise resource planning
core software platform
private exchanges
integration technology
middleware
XML standards
content management capabilities


Development of an integrated and open-architecture precision motion control system

Abstract: In this paper, the development of an integrated and open-architecture precision motion control system is presented. The control system is generally applicable, but it is developed with a particular focus on direct drive servo systems based on linear motors. The overall control system is comprehensive, comprising of various selected control and instrumentation components, integrated within a configuration of hardware architecture centred around a dSPACE DS1004 DSP processor board. These components include a precision composite controller (comprising of feedforward and feedback control), a disturbance observer, an adaptive notch filter, and a geometrical error compensator. The hardware architecture, software development platform, user interface, and all constituent control components are described

motion control
direct drive servo systems
linear motors
dSPACE DS1004 processor
composite controller
feedforward
feedback
adaptive notch filter
open-architecture
precision
geometrical error compensation


Development of a 3.5 inch magneto-optical disk with a capacity of 2.3 GB

Abstract: The recording capacity of GIGAMO media was enlarged from 1.3 GB to 2.3 GB for 3.5 inch magneto-optical (MO) disks while maintaining downward compatibility. For the new GIGAMO technology, a land and groove recording method was applied in addition to magnetically induced super resolution (MSR) media. Furthermore, a novel address format suitable for the land and groove recording method was adopted. The specifications of the new GIGAMO media were examined to satisfy requirements for practical use with respect to margins. Durability of more than 10/sup 6/ rewritings and an enough lifetime were confirmed

magneto-optical disk
recording capacity
GIGAMO media
MO disks
land-groove recording method
magnetically induced super resolution
MSR
address format
rewriting durability
lifetime
crosstalk
3.5 inch
2.3 GB
SiN-GdFeCo-GdFe-TbFeCo-SiN-Al


Six common enterprise programming mistakes

Abstract: Instead of giving you tips to use in your programming (at least directly), I want to look at some common mistakes made in enterprise programming. Instead of focusing on what to do, I want to look at what you should not do. Most programmers take books like mine and add in the good things, but they leave their mistakes in the very same programs! So I touch on several common errors I see in enterprise programming, and then briefly mention how to avoid those mistakes

enterprise programming mistakes
common errors
data store
database
XML
Enterprise JavaBeans
vendor-specific programming


Micro-optical realization of arrays of selectively addressable dipole traps: a scalable configuration for quantum computation with atomic qubits

Abstract: We experimentally demonstrate novel structures for the realization of registers of atomic qubits: We trap neutral atoms in one- and two-dimensional arrays of far-detuned dipole traps obtained by focusing a red-detuned laser beam with a microfabricated array of microlenses. We are able to selectively address individual trap sites due to their large lateral separation of 125 mu m. We initialize and read out different internal states for the individual sites. We also create two interleaved sets of trap arrays with adjustable separation, as required for many proposed implementations of quantum gate operations

atomic qubits
registers
neutral atoms
far-detuned dipole traps
red-detuned laser beam
microfabricated array
microlenses
internal states
quantum gate operations
quantum computation
scalable configuration


An adaptive sphere-fitting method for sequential tolerance control

Abstract: The machining of complex parts typically involves a logical and chronological sequence of n operations on m machine tools. Because manufacturing datums cannot always match design constraints, some of the design specifications imposed on the part are usually satisfied by distinct subsets of the n operations prescribed in the process plan. Conventional tolerance control specifies a fixed set point for each operation and a permissible variation about this set point to insure compliance with the specifications, whereas sequential tolerance control (STC) uses real-time measurement information at the completion of one stage to reposition the set point for subsequent operations. However, it has been shown that earlier sphere-fitting methods for STC can lead to inferior solutions when the process distributions are skewed. This paper introduces an extension of STC that uses an adaptive sphere-fitting method that significantly improves the yield in the presence of skewed distributions as well as significantly reducing the computational effort required by earlier probabilistic search methods

machine tools
sequential tolerance control
adaptive sphere-fitting method
design constraints
compliance
real-time measurement information
yield improvement
skewed distributions
computational effort


Aggregate bandwidth estimation in stored video distribution systems

Abstract: Multimedia applications like video on demand, distance learning, Internet video broadcast, etc. will play a fundamental role in future broadband networks. A common aspect of such applications is the transmission of video streams that require a sustained relatively high bandwidth with stringent requirements of quality of service. In this paper various original algorithms for evaluating, in a video distribution system, a statistical estimation of aggregate bandwidth needed by a given number of smoothed video streams are proposed and discussed. The variable bit rate traffic generated by each video stream is characterized by its marginal distribution and by conditional probabilities between rates of temporary closed streams. The developed iterative algorithms evaluate an upper and lower bound of needed bandwidth for guaranteeing a given loss probability. The obtained results are compared with simulations and with other results, based on similar assumptions, already presented in the literature. Some considerations on the developed algorithms are made, in order to evaluate the effectiveness of the proposed methods

aggregate bandwidth estimation
stored video distribution systems
multimedia applications
video on demand
distance learning
Internet video broadcast
broadband networks
video streams transmission
quality of service
statistical estimation
variable bit rate traffic
marginal distribution
conditional probabilities
temporary closed streams
iterative algorithms
upper bound
lower bound
loss probability
simulations
VoD
video coding
QoS


Keeping Web accessibility in mind: I&R services for all

Abstract: After presenting three compelling reasons for making Web sites accessible to persons with a broad range of disabilities (it's the morally right thing to do, it's the smart thing to do from an economic perspective, and it's required by law), the author discusses design issues that impact persons with particular types of disabilities. She presents practical advice for assessing and addressing accessibility problems. An extensive list of resources for further information is appended, as is a list of sites which simulate the impact of specific accessibility problems on persons with disabilities

Web site accessibility
information and referral services
disabilities


Raising the standard of management education for electronic commerce professionals

Abstract: The teaching of electronic commerce in universities has become a growth industry in itself. The rapid expansion of electronic commerce programmes raises the question of what actually is being taught. The association of electronic commerce as primarily a technical or information technology (IT) phenomenon has not been sufficient to constrain it to IT and information systems departments. Business schools have been keen entrants into the electronic commerce coursework race and they are developing electronic commerce programmes in an environment where there is no agreed definition of the term. This paper draws on the work of Kenneth Boulding who argued that the dynamics of change in society are largely a product of changing skills and the way these skills are arranged into roles at the organizational level. It is argued that an overly technical interpretation of electronic commerce narrows the skills being acquired as part of formal education. Universities, under pressure from the market and technological change, are changing their roles resulting in a further narrowing of the breadth of issues that is seen as legitimate to be included as electronic commerce. The outcome is that aspiring electronic commerce professionals are not being exposed to a wide enough agenda of ideas and concepts that will assist them to make better business decisions

management education standards improvement


Instability phenomena in the gas-metal arc welding self-regulation process

Abstract: Arc instability is a very important determinant of weld quality. The instability behaviour of the gas-metal arc welding (GMAW) process is characterized by strong oscillations in arc length and current. In the paper, a model of the GMAW process is developed using an exact arc voltage characteristic. This model is used to study stability of the self-regulation process and to develop a simulation program that helps to understand the transient or dynamic nature of the GMAW process and relationships among current, electrode extension and contact tube-work distance. The process is shown to exhibit instabilities at both long electrode extension and normal extension. Results obtained from simulation runs of the model were also experimentally confirmed by the present author, as reported in this study. In order to explain the concept of the instability phenomena, the metal transfer mode and the arc voltage-current characteristic were examined. Based on this examination, the conclusion of this study is that their combined effects lead to the oscillations in arc current and length

instability phenomena
gas-metal arc welding
self-regulation process
arc instability
weld quality
GMAW process
exact arc voltage characteristic
metal transfer mode


Supersampling multiframe blind deconvolution resolution enhancement of adaptive optics compensated imagery of low earth orbit satellites

Abstract: We describe a postprocessing methodology for reconstructing undersampled image sequences with randomly varying blur that can provide image enhancement beyond the sampling resolution of the sensor. This method is demonstrated on simulated imagery and on adaptive-optics-(AO)-compensated imagery taken by the Starfire Optical Range 3.5-m telescope that has been artificially undersampled. Also shown are the results of multiframe blind deconvolution of some of the highest quality optical imagery of low earth orbit satellites collected with a ground-based telescope to date. The algorithm used is a generalization of multiframe blind deconvolution techniques that include a representation of spatial sampling by the focal plane array elements based on a forward stochastic model. This generalization enables the random shifts and shape of the AO-compensated point spread function (PSF) to be used to partially eliminate the aliasing effects associated with sub-Nyquist sampling of the image by the focal plane array. The method could be used to reduce resolution loss that occurs when imaging in wide-field-of-view (FOV) modes

supersampling multiframe blind deconvolution resolution enhancement

undersampled image sequence reconstruction


Quantum universal variable-length source coding

Abstract: We construct an optimal quantum universal variable-length code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate exponentially goes to 0. Our code is optimal in the sense of its exponent. In addition, its average error asymptotically tends to 0

quantum universal variable-length source coding


New investors get steal of a deal [Global Crossing]

Abstract: Hutchison Telecommunications and Singapore Technologies take control of Global Crossing for a lot less money than they originally offered. The deal leaves the bankrupt carrier intact, but doesn't put it in the clear just yet

Hutchison Telecommunications
Singapore Technologies
Global Crossing
bankrupt


Design and manufacture of a lightweight piezo-composite curved actuator

Abstract: In this paper we are concerned with the design, manufacture and performance test of a lightweight piezo-composite curved actuator (called LIPCA) using a top carbon fiber composite layer with near-zero coefficient of thermal expansion (CTE), a middle PZT ceramic wafer, and a bottom glass/epoxy layer with a high CTE. The main point of the design for LIPCA is to replace the heavy metal layers of THUNDER TM by lightweight fiber reinforced plastic layers without losing the capabilities for generating high force and large displacement. It is possible to save up to about 40% of the weight if we replace the metallic backing material by the light fiber composite layer. We can also have design flexibility by selecting the fiber direction and the size of prepreg layers. In addition to the lightweight advantage and design flexibility, the proposed device can be manufactured without adhesive layers when we use an epoxy resin prepreg system. Glass/epoxy prepregs, a ceramic wafer with electrode surfaces, and a carbon prepreg were simply stacked and cured at an elevated temperature (177 degrees C) after following an autoclave bagging process. We found that the manufactured composite laminate device had a sufficient curvature after being detached from a flat mould. An analysis method using the classical lamination theory is presented to predict the curvature of LIPCA after curing at an elevated temperature. The predicted curvatures are in quite good agreement with the experimental values. In order to investigate the merits of LIPCA, performance tests of both LIPCA and THUNDER TM have been conducted under the same boundary conditions. From the experimental actuation tests, it was observed that the developed actuator could generate larger actuation displacement than THUNDER TM


Controlling in between the Lorenz and the Chen systems

Abstract: This letter investigates a new chaotic system and its role as a joint function between two complex chaotic systems, the Lorenz and the Chen systems, using a simple variable constant controller. With the gradual tuning of the controller, the controlled system evolves from the canonical Lorenz attractor to the Chen attractor through the new transition chaotic attractor. This evolving procedure reveals the forming mechanisms of all similar and closely related chaotic systems, and demonstrates that a simple control technique can be very useful in generating and analyzing some complex chaotic dynamical phenomena

Chen attractors
Chen system
Lorenz system
tuning
Lorenz attractor
transition chaotic attractor


A fast implementation of correlation of long data sequences for coherent receivers

Abstract: Coherent reception depends upon matching of phase between the transmitted and received signal. Fast convolution techniques based on fast Fourier transform (FFT) are widely used for extracting time delay information from such matching. The latency in processing a large data window of the received signal is a serious overhead for mission critical real time applications. The implementation of a parallel algorithm for correlation of long data sequences in multiprocessor environment is demonstrated here. The algorithm does processing while acquiring the received signal and reduces the computation overhead considerably because of inherent parallelism

correlation
long data sequences
coherent receivers
transmitted signal
received signal
fast Fourier transform
time delay information
latency
mission critical real time applications
parallel algorithm
multiprocessor environment
computation


Modeling frequently accessed wireless data with weak consistency

Abstract: To reduce the response times of wireless data access in a mobile network, caches are utilized in wireless handheld devices. If the original data entry has been updated, the cached data in the handheld device becomes stale. Thus, a mechanism is required to predict when the cached copy will expire. This paper studies a weakly consistent data access mechanism that computes the time-to-live (TTL) interval to predict the expiration time. We propose an analytic model to investigate this TTL-based algorithm for frequently accessed data. The analytic model is validated against simulation experiments. Our study quantitatively indicates how the TTL-based algorithm reduces the wireless communication cost by increasing the probability of stale accesses. Depending on the requirements of the application, appropriate parameter values can be selected based on the guidelines provided

frequently accessed wireless data modeling


How closely can a personal computer clock track the UTC timescale via the Internet?

Abstract: Nowadays many software packages allow you to keep the clock of your personal computer synchronized to time servers spread over the internet. We present how a didactic laboratory can evaluate, in a statistical sense, the minimum synch error of this process (the other extreme, the maximum, is guaranteed by the code itself). The measurement set-up utilizes the global positioning system satellite constellation in 'common view' between two similar timing stations: one acts as a time server for the other, so the final timing difference at the second station represents the total synch error through the internet. Data recorded over batches of 10000 samples show a typical RMS value of 35 ms. This measurement configuration allows students to obtain a much better understanding of the synch task and pushes them, at all times, to look for an experimental verification of data results, even when they come from the most sophisticated 'black boxes' now readily available off the shelf