ppxscal/embedding_network huggingface dataset:
Fusion of spatial relationships for guiding recognition, example of brain structure recognition in 3D MRI
Authors: Isabelle Bloch, Olivier Colliot, Oscar Camara, Thierry Géraud
Venue: Pattern Recognition Letters (2005)

Spatial relations play an important role in recognition of structures embedded in a complex environment and for reasoning under imprecision. Several types of relationships can be modeled in a unified way using fuzzy mathematical morphology. Their combination benefits from the powerful framework of fuzzy set theory for fusion tasks and decision making. This paper presents several methods of fusion of information about spatial relationships and illustrates them on the example of model-based recognition of brain structures in 3D magnetic resonance imaging.
UNISYS: description of the CBAS system used for MUC-5
Authors: Carl Weir, Rich Fritzson
Venue: Proceedings of the 5th conference on Message understanding (1993)

This paper describes CBAS, a data extraction system with rule-based reasoning modules. The CBAS architecture depicted in Figure 1 emphasizes the use of multiple processors to detect significant primitive facts which are then processed by reasoning modules implemented as collections of forward-chaining rules to infer additional information. A guiding principle behind the architecture is to rely as much as possible on initial processors with relatively simple internal structure in order to insure greater robustness. However, the model does allow for the use of sophisticated initial processors, processors which embody linguistic analysis techniques. This emphasis on collections of multiple preprocessors which provide sets of primitive facts to be reasoned about is reminiscent of the standard architecture proposed for multisensor data fusion systems (where preprocessor = sensor) [5].
Safe instantiation in generic Java
Authors: Eric E. Allen, Robert Cartwright
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

This paper presents the "Safe-Instantiation Principle," a new design principle for evaluating extensions of Java with support for generic types. We discuss the GJ and NextGen formulations of Generic Java and the implications of safe instantiation on both approaches. We then consider the implications of safe-instantiation for the addition of mixins to Java via generic types. Finally, we defend the formulation of mixins as hygienic program constructs, arguing that a hygienic formulation is the only way to maintain safe instantiation and type soundness in Java with mixins, and to prevent the introduction of insidious bugs with no clearly defined point of blame.
Migrating web application sessions in mobile computing
Authors: G. Canfora, G. Di Santo, G. Venturi, E. Zimeo, M. V. Zito
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

The capability to change user agent while working is starting to appear in state of the art mobile computing due to the proliferation of different kinds of devices, ranging from personal wireless devices to desktop computers, and to the consequent necessity of migrating working sessions from a device to a more apt one. Research results related to the hand-off at low level are not sufficient to solve the problem at application level. The paper presents a scheme for session hand-off in Web applications which, by exploiting a proxy-based architecture, is able to work without interventions on existing code.
A Framework for a Clinical Reasoning Knowledge Warehouse
Authors: Klaus Vilstrup Pedersen
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

In many areas of the medical domain, the decision process i.e. reasoning, involving health care professionals is distributed, cooperative and complex. This paper presents a framework for a Clinical Reasoning Knowledge Warehouse that combines theories and models from Artificial Intelligence, Knowledge Management Systems and Business Intelligence to make context based, patient case specific analysis and knowledge management. The knowledge base integrates three sources of information that supports clinical reasoning: general information, guidelines and health records. New generalized knowledge is stored and made accessible when relevant to the reasoning context and the specific patient case. Furthermore, the information structure supports the creation of new generalized knowledge using data mining tools. The patient case is divided into an observation level and an opinion level. At the opinion level, reasoning participants can express their argument based opinions about a patient case, thereby enhancing the knowledge about the state of and plans for the patient. An opinion language that supports expressing a possible imprecise/uncertain opinion based on imprecise/uncertain/incomplete arguments is introduced. Finally, case based reasoning is used for retrieving similar patient cases and adapt the opinions in the current case.
Comparative Assessment of Adaptive Body-Bias SOI Pass-Transistor Logic
Authors: Geun Rae Cho, Tom Chen
Venue: Analog Integrated Circuits and Signal Processing (2005)

We present a silicon-on-insulator (SOI) pass-transistor logic (PTL) gate with an active body bias control circuit and compare the proposed PTL gate with other types of PTL gates with different body bias circuits in two different 0.13 ¿m SOI CMOS technologies. The experimental results show that the proposed SOI PTL gate using the body bias controlled technique is superior in terms of performance and power consumption than other DTMOS PTL gates.
Investigation on the performance of space-time block coded ultrawide band communication systems: Research Articles
Authors: Yinggang Du, Kam Tai Chan
Venue: Wireless Communications Mobile Computing (2005)

Ultrawide band (UWB) communication systems show many advantages over the conventional narrow band systems. In this paper, three UWB systems at the same transmission efficiency are investigated. The first one is a conventional system with only one transmit antenna (non-STBC). The second one is combined with the space-time block coding (STBC) over one symbol (STBC-1). The third system is combined with the STBC over two symbols (STBC-2), which is in accordance with Almouti's scheme. Both theoretical analysis and simulations show that the STBC-1 system performs the best. In addition, the adoption of the normalized modified Hermite polynomial based orthogonal pulses (NMHP) instead of the Gaussian pulse (GP) to represent the M-ary symbol constellation can increase the data rate and lead to an improvement of the signal to noise ratio (SNR) by about 10log10M dB at the bit error rate (BER) of 10-4 at any symbol constellation for any UWB system. The simulations in both flat-fading channels and frequency-selective channels have confirmed such improvement. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Dr. J vs. the bird: Java IDE's one-on-one
Authors: Michael Olan
Venue: Journal of Computing Sciences in Colleges (2004)

An important decision facing instructors of introductory programming courses is the choice of supporting software development tools. Usually this involves selecting an integrated development environment (IDE). BlueJ has received widespread adoption for first year courses that use the Java programming language; however, DrJava is emerging as an alternative. This paper features a comparison of the pedagogical approaches used by BlueJ and DrJava as a guideline for selecting the tool best suited to the teaching style used in the introductory course.
Overview of the Face Recognition Grand Challenge
Authors: P. Jonathon Phillips, Patrick J. Flynn, Todd Scruggs, Kevin W. Bowyer, Jin Chang, Kevin Hoffman, Joe Marques, Jaesik Min, William Worek
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Over the last couple of years, face recognition researchers have been developing new techniques. These developments are being fueled by advances in computer vision techniques, computer design, sensor design, and interest in fielding face recognition systems. Such advances hold the promise of reducing the error rate in face recognition systems by an order of magnitude over Face Recognition Vendor Test (FRVT) 2002 results. The Face Recognition Grand Challenge (FRGC) is designed to achieve this performance goal by presenting to researchers a six-experiment challenge problem along with data corpus of 50,000 images. The data consists of 3D scans and high resolution still imagery taken under controlled and uncontrolled conditions. This paper describes the challenge problem, data corpus, and presents baseline performance and preliminary results on natural statistics of facial imagery.
Alphabetically constrained keypad designs for text entry on mobile devices
Authors: Jun Gong, Peter Tarasewich
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

The creation of text will remain a necessary part of human-computer interaction with mobile devices, even as they continue to shrink in size. On mobile phones, text is often entered using keypads and predictive text entry techniques, which attempt to minimize the effort (e.g., number of key presses) needed to enter words. This research presents results from the design and testing of alphabetically-constrained keypads, optimized on various word lists, for predictive text entry on mobile devices. Complete enumeration and Genetic Algorithm-based heuristics were used to find keypad designs based on different numbers of keys. Results show that alphabetically-constrained designs can be found that are close to unconstrained designs in terms of performance. User testing supports the hypothesis that novice ease of learning, usability, and performance is greater for constrained designs when compared to unconstrained designs. The effect of different word lists on keypad design and performance is also discussed.
Sequencing by hybridization with isothermic oligonucleotide libraries
Authors: Jacek Błazewicz, Piotr Formanowicz, Marta Kasprzak, Wojciech T. Markiewicz
Venue: Discrete Applied Mathematics (2004)

The problem addressed in this paper is concerned with DNA sequencing by hybridization. A new type of oligonucleotide libraries is proposed for hybridization experiments. The libraries consist of oligonucleotides of different length dependent on an oligonucleotide A(T) and C(G) content in such a way that an increment of C(G) is twice of that of A(T) and the sum of increments for each oligonucleotide is constant for a library. The latter is called an isothermic oligonucleotide library and the way of its construction will be presented. It will be shown that two such libraries that differ in their sums of increments by an A(T) increment are sufficient for DNA sequencing by hybridization. The hybridization experiment using isothermic oligonucleotide libraries should supply data with a lower number of errors due to the expected similarity of melting temperatures of oligonucleotide duplexes, thus, offering more stable conditions of the hybridization experiment. The combinatorial part of the general problem of DNA sequencing (allowing all kinds of errors) with isothermic libraries will be then formulated, and the ways of solving it will be shown. The general problem will be proved to be strongly NP-hard, but heuristic algorithms solving this problem are reported to have better computational features than those for standard libraries.
Effective Co-Verification of IEEE 802.11a MAC/PHY Combining Emulation and Simulation Technology
Authors: IL-Gu Lee, Seung-Beom Lee, Sin-Chong Park
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

This work presents a system architecture and effective co-verification methodologies for the IEEE 802.11a Medium Access Control (MAC) layer/Physical (PHY) layer implementation. The architecture modeling includes hardware/software partitioning of a total system based on timing measurements from the C/C++ and Verilog design, and analysis of real-time requirements specified in the standard. The system is built on an evaluation platform that contains a Xilinx Virtex-II FPGA and an Altera Excalibur ARM922. We present an approach that combines emulation and simulation for efficient debugging of the IEEE 802.11a Wireless LAN using various verification technologies.
Hardware Synthesis from Coarse-Grained Dataflow Specification for Fast HW/SW Cosynthesis
Authors: Hyunuk Jung, Soonhoi Ha
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in DFG represents a coarse grain block such as FIR and DCT and a port in a block may consume multiple data samples per invocation, which distinguishes our approach from behavioral synthesis and complicates the problem. In the presented design methodology, a dataflow graph with specified algorithm can be mapped to various hardware structures according to the resource allocation and schedule information. This simplifies the management of the area/performance tradeoff in hardware design and widens the design space of hardware implementation of a dataflow graph compared with the previous approaches. Through experiments with some examples, the usefulness of the proposed technique is demonstrated.
Spatial Models for Wide-Area Visual Surveillance: Computational Approaches and Spatial Building-Blocks
Authors: Richard J. Howarth
Venue: Artificial Intelligence Review (2005)

Spatial models play a key role when interpreting a dynamic and uncertain world for a wide-area surveillance application. This paper presents two different views to illustrate the range of spatial models. First, we take a top-down look, where we survey various work relevant to the development of spatial models and how they have been used in AI applications. Then we take a more bottom-up look, starting with a promising spatial primitive to identify a useful foundation that can support visual surveillance applications.
News 2.0
Authors: John Stanik
Venue: Queue (2005)

It&rsquo;s well known that computer science education in the U.S. is in decline. From secondary schools up to graduate degree programs, the U.S. has witnessed a steady drop in enrollment in computer science courses. Many factors are responsible&mdash;in particular, the dot-com bust, outsourcing fears, and declines in federal spending on fundamental CS research. A vicious cycle is in the works, whereby fears about job prospects will drive possible CS candidates into other fields, only to provide fuel for the outsourcing fire as the pool of native IT workers shrinks.
Adaptive control of robot manipulators with neural network based compensation of frictional uncertainties
Authors: M. Kemal Ciliz
Venue: Robotica (2005)

In this paper a framework is proposed for the adaptive control of robotic manipulators which combines parametric adaptive control with Artificial Neural Network (ANN)-based compensation of dynamic uncertainties like friction. The proposed method utilizes a passivity-based parametric adaptive control approach and makes use of the ANN models as generic identifiers to compensate for unmodelled friction effects. Unlike many approaches for ANN based control in the literature, parameter update equations for the ANN model and for the parametric adaptive model are driven by both the tracking error and the system identification error. A stability analysis is given based on the passivity properties of the manipulator dynamics. The methodology is successfully tested for the control of a Direct Drive SCARA arm and performance is compared with standard adaptive control schemes.
A DDRR-Based Scheduler to Achieve Proportional Delay Differentiation in Terabit Network
Authors: Chin-Chi Wu, Hsien-Ming Wu, Chia-Lung Liu, Woei Lin
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In recent years much attention has been given to providing the proportional delay differentiation through thepacket scheduling. The issue of the performance of the scheduling algorithms also increases in importance when the line speed increases significantly as a result of the optical technology. this paper we propose an efficient packet scheduling scheme modified from the dynamic deficit round-robin (DDRR)scheduling algorithm. The new scheme not only provides the tuning knob for adjusting the relative QoS in the packet delay, but also performs schedulingat 0(1) complexity and with very small overhead. Simulation results show the effectiveness of the modified algorithm.
Power-Aware Storage Cache Management
Authors: Qingbo Zhu, Yuanyuan Zhou
Venue: IEEE Transactions on Computers (2005)

Reducing energy consumption is an important issue for data centers. Among the various components of a data center, storage is one of the biggest energy consumers. Previous studies have shown that the average idle period for a server disk in a data center is very small compared to the time taken to spin down and spin up. This significantly limits the effectiveness of disk power management schemes. This article proposes several power-aware storage cache management algorithms that provide more opportunities for the underlying disk power management schemes to save energy. More specifically, we present an offline energy-optimal cache replacement algorithm using dynamic programming, which minimizes the disk energy consumption. We also present an offline power-aware greedy algorithm that is more energy-efficient than Belady's offline algorithm (which minimizes cache misses only). We also propose two online power-aware algorithms, PA-LRU and PB-LRU. Simulation results with both a real system and synthetic workloads show that, compared to LRU, our online algorithms can save up to 22 percent more disk energy and provide up to 64 percent better average response time. We have also investigated the effects of four storage cache write policies on disk energy consumption.
The Theory of Elimination Trees for Sparse Unsymmetric Matrices
Authors: Stanley C. Eisenstat, Joseph W. H. Liu
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

The elimination tree of a symmetric matrix plays an important role in sparse matrix factorization. By using paths instead of edges to define the tree, we generalize this structure to unsymmetric matrices while retaining many of its properties. If we use a tree traversal to reorder a matrix into a bordered block triangular form, the structure has further desirable properties relevant to a sparse LU factorization of the reordered matrix. When pivoting is required for stability, the tree changes only locally if the choice of pivot is suitably restricted.
A linguistic discovery program that verbalizes its discoveries
Authors: Vladimir Pericliev
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

We describe a discovery program, called UNIVAUTO (UNIVersals AUthoringTOol), whose domain of application is the study of language universals, a classic trend in contemporary linguistics. Accepting as input information about languages, presented in terms of feature-values, the discoveries of another human agent arising from the same data, as well as some additional data, the program discovers the universals in the data, compares them with the discoveries of the human agent and, if appropriate, generates a report in English on its discoveries. Running UNIVAUTO on the data from the seminal paper of Greenberg (1966) on word order universals, the system has produced several linguistically valuable texts, two of which are published in a refereed linguistic journal.
Direct numerical simulation of the Brownian motion of particles by using fluctuating hydrodynamic equations
Authors: Nitin Sharma, Neelesh A. Patankar
Venue: Journal of Computational Physics (2004)

In this paper, we present a direct numerical simulation scheme for the Brownian motion of particles. In this approach, the thermal fluctuations are included in the fluid equations via random stress terms. Solving the fluctuating hydrodynamic equations coupled with the particle equations of motion result in the Brownian motion of the particles. There is no need to add a random force term in the particle equations. The particles acquire random motion through the hydrodynamic force acting on its surface from the surrounding fluctuating fluid. The random stress in the fluid equations are easy to calculate unlike the random terms in the conventional Brownian dynamics type approaches. We present a three-dimensional implementation along with validation.
Subdivision method to create furcating object with multibranches
Authors: Shiqi Ou, Hongzan Bin
Venue: The Visual Computer: International Journal of Computer Graphics (2005)

A novel interim core scheme (ICS) is presented in this paper to construct a furcating object with multibranches. These M branches with arbitrary N-sided boundaries can be positioned freely but cannot be overlapped with each other. A furcating object can be built by blending these branches. The essence of the scheme is to construct a joint mesh that blends the initial control meshes of the M branches, and the smoothness of the resulting surfaces will only depend on the joint mesh and subdivision scheme applied. Some illustrative objects are given to verify the feasibility of ICS.
Constraint Lingo: towards high-level constraint programming
Authors: Raphael Finkel, Victor W. Marek, Mirosław Truszczyński
Venue: Software&mdash;Practice Experience (2004)

Logic programming requires that the programmer convert a problem into a set of constraints based on predicates. Choosing the predicates and introducing appropriate constraints can be intricate and error prone. If the problem domain is structured enough, we can let the programmer express the problem in terms of more abstract, higher-level constraints. A compiler can then convert the higher-level program into a logic-programming formalism. The compiler writer can experiment with alternative low-level representations of the higher-level constraints in order to achieve a high-quality translation. The programmer can then take advantage of both a reduction in complexity and an improvement in runtime speed for all problems within the domain. We apply this analysis to the domain of tabular constraint-satisfaction problems. Examples of such problems include logic puzzles solvable on a hatch grid and combinatorial problems such as graph coloring and independent sets. The proper abstractions for these problems are rows, columns, entries, and their interactions. We present a higher-level language, Constraint Lingo, dedicated to problems in this domain. We also describe how we translate programs from Constraint Lingo into lower-level logic formalisms such as the logic of propositional schemata. These translations require that we choose among competing lower-level representations in order to produce efficient results. The overall effectiveness of our approach depends on the appropriateness of Constraint Lingo, our ability to translate Constraint Lingo programs into high-quality representations in logic formalisms, and the efficiency with which logic engines can compute answer sets. We comment on our computational experience with these tools in solving both graph problems and logic puzzles. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Title: ITGuru - a powerful network simulation environment for teaching and research
Authors: Victor A. Clincy
Venue: Journal of Computing Sciences in Colleges (2004)

ITGuru is a powerful simulation environment developed by OpNET Corporation. ITGuru is unique because of its ability to model the entire network, including its routers, switches, protocols, servers, and the individual applications they support. ITGuru improves network designers and instructors the ability to identify and solve problems throughout their network. ITGuru assesses application impact, automates diagnostic testing, expedites server capacity planning and consolidation, analyzes failure impact, and enables network growth planning