ppxscal/embedding_network huggingface dataset:
Computer Assisted Surgical Planner for Craniofacial Reconstruction - Imaging Techniques
Authors: Mohammad Azam Rana, Halim Setan, Zulkepli Majid, Albert K. Chong
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

Computer Tomography (CT) and Magnetic Resonance Imagery (MRI) have had an enormous impact in medicine. Using medical imagery, Computer Assisted Surgery (CAS) systems decrease the invasiveness of surgical procedures, increase accuracy and facilitate surgical planning and analysis. Craniofacial anomalies and fine anatomic details of facial traumic injuries can be well studied with such imaging techniques. This research is focused on reconstruction of human hard/soft tissues and anthropometric landmarks for craniofacial surgery. The data capture devices used include CT scanner, 3D Laser Scanner and Close Range Photogrammetry. The visualization of soft tissue superimposed on hard tissue, display of tissue with varying opacity, and cutting of tissues for detailed analysis and planning has been demonstrated in this paper.
The Feasibility Analysis of Multiprocessor Real-Time Systems
Authors: Sanjoy Baruah, Nathan Fisher
Venue: Proceedings of the 18th Euromicro Conference on Real-Time Systems (2006)

The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for determining whether a given collection of jobs can be scheduled to meet all deadlines upon a specified multiprocessor platform - these tests may be applied even when the collection of jobs is incompletely specified. The applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks is discussed.
An Incrementally Modular Abstraction Hierarchy for Linear Software Development Methodology
Authors: Kenji Ohmori, Tosiyasu L. Kunii
Venue: Proceedings of the 2006 International Conference on Cyberworlds (2006)

The incrementally modular abstraction hierarchy, which specifies architecture and modeling of cyberworlds and defines the most general invariants at the higher levels and preserving them at the lower levels, are applied to software development to show that its linear increment of modules prevents combinatorial explosion of design- and test-processes.
Testing marginal homogeneity against stochastically ordered marginals for r×r contingency tables
Authors: Wei Gao, Satoshi Kuriki
Venue: Journal of Multivariate Analysis (2006)

A square contingency table often appears in social, biomedical and behavioral science to be used to display joint responses when two variables have the same category levels. When responses are ordered categories, it is usually important to test the hypotheses of marginal homogeneity against stochastically ordered marginals. In this paper, a test statistic based on the Kullback-Leibler divergence is proposed. An algorithm for computing the Kullback-Leibler measure of discrepancy is provided. The related asymptotic distribution under marginal homogeneity is the Chi-bar square distribution.
Simulation of natural daylight illumination determined by a high dynamic range image
Authors: A. G. Voloboi, V. A. Galaktionov, E. A. Kopylov, L. Z. Shapiro
Venue: Programming and Computing Software (2006)

The use of high dynamic range images as a source of the natural daylight illumination and a background for virtual scenes containing objects with complex optic properties (fabrics, automobile multilayer paints, etc.) is considered. Physically justified algorithms for calculating the luminance of a point, recognition of the sun, generation of shadows, and background specification are considered. An analysis of the correctness of the available high dynamic range images is performed, and their drawbacks are discussed. Modifications of the algorithms are developed that correct these drawbacks in the case of simulating the illumination based on the sky models adopted by the International Commission on Illumination (CIE). The modified illumination simulation algorithms make it possible to produce more accurate images; moreover, they are automatic, and robust with respect to errors in high dynamic range images. These algorithms are used in several computer graphics systems for generating realistic images. A version of this paper with color figures can be found at http://www.keldysh.ru/pages/cgraph/publications/cgd_publ.htm .
Scale splitting control for an atom wave packet coherent scattering in modulated standing wave
Authors: S. V. Borisenok, Y. V. Rozhdestvensky, G. G. Udov
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

Recently, coherent splitting has been achieved by scattering of an atom wave packet in standing wave with modulated intensity. We demonstrate now as the result of such scattering depends on the initial modulation phase, e.g., the scattering pictures are different for 'cos' and 'sin' modulation functions and the increasing of coherent components with defined atom momentum occurs for 'cos' modulation function only. As a result, we have reached the conclusion that the shape of the pulse modulation does not influence to the scattering pictures, and for any modulation function we can always choose such values of amplitude modulation when only two components will be dominated in the scattering.
History-based traffic control
Authors: Gabriel Balan, Sean Luke
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

What if traffic lights gave you a break after you've spent a long time waiting in traffic elsewhere? In this paper we examine a variety of multi-agent traffic light controllers which consider vehicles' past stopped-at-red histories. For example, a controller might distribute credits to cars as they wait and award the green light to lanes with the most credits, allowing cars to keep the credits they accumulate during travel. Such history-based controllers are intended to provide a kind of global fairness, reducing the variance in mean time spent waiting at lights during trips. We compare these controllers against other multi-agent controllers which only consider present information, and discover, among other things, that while the history-based controllers are among the most robust, they often unexpectedly provide more efficiency than fairness.
Algorithms, theory and applications for information extraction from textual data
Authors: William M. Pottenger
Venue:  (2006)

In this dissertation I present a semi-supervised active learning algorithm for pattern discovery in information extraction from textual data. The patterns are reduced regular expressions composed of various characteristics of features useful in information extraction. The major contribution is a semi-supervised learning algorithm that extracts information from a set of examples labeled as relevant or irrelevant to a given attribute. The approach is semi-supervised because it does not require precise labeling of the exact location of features in the training data. This significantly reduces the effort needed to develop a training set. An active learning algorithm is used to assist the semi-supervised learning algorithm in order to further reduce training set development effort. The active learning algorithm is seeded with a single positive example of a given attribute. The context of the seed is used to automatically identify candidates for additional positive examples of the given attribute. Candidate examples are manually pruned during the active learning phase, and our semi-supervised learning algorithm automatically discovers reduced regular expressions for each attribute. I have successfully applied this learning technique in the extraction of textual features from police incident reports, university crime reports, and patents. The performance of our algorithm compares favorably with competitive extraction systems being used in criminal justice information systems.
Single-threaded specification of process-interaction formalism in Java
Authors: Peter H. M. Jacobs, Alexander Verbraeck
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In order to support the conceptualization and specification of simulation models of complex systems, several formalisms or world views exist. Petri nets, differential equations, discrete event system specification and process interaction are typical examples. Throughout the last decade many have attempted to implement the process interaction formalism in Java. These initiatives mostly resulted in multi-threaded simulation languages in which a Process extends a Thread. These threads are then sequentially suspended and resumed. The article "Why are Thread.stop, Thread.suspend and Thread.resume Deprecated?" (Sun Microsystems 1999) implicitly ended most of these deadlock prone initiatives. This paper introduces a unique single-threaded implementation of this world view by introducing a Java-based Java interpreter, which is used only to interpret pausable processes. This interpreter supports all Java programming constructs and hopefully serves as a cornerstone for renewed development of process oriented Java based simulation languages.
Application of Agent Negotiation in Supporting Adaptive Learning
Authors: K. Robert Lai, Chung Hsien Lan, Chen Chung Liu
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This study presents a negotiation-based e-learning framework to promote learning motive and enhance the interaction between learners and instructors. In terms of learning communication, a fuzzy constraint-based agent negotiation mechanism is proposed as a flexible model to suggest pedagogies or learning strategies. Examples are provided to illustrate the proposed framework for constructive and collaborative learning.
Representation and timing in theories of the dopamine system
Authors: Nathaniel D. Daw, Aaron C. Courville, David S. Tourtezky
Venue: Neural Computation (2006)

Although the responses of dopamine neurons in the primate midbrain are well characterized as carrying a temporal difference (TD) error signal for reward prediction, existing theories do not offer a credible account of how the brain keeps track of past sensory events that may be relevant to predicting future reward. Empirically, these shortcomings of previous theories are particularly evident in their account of experiments in which animals were exposed to variation in the timing of events. The original theories mispredicted the results of such experiments due to their use of a representational device called a tapped delay line.Here we propose that a richer understanding of history representation and a better account of these experiments can be given by considering TD algorithms for a formal setting that incorporates two features not originally considered in theories of the dopaminergic response: partial observability (a distinction between the animal's sensory experience and the true underlying state of the world) and semi-Markov dynamics (an explicit account of variation in the intervals between events). The new theory situates the dopaminergic system in a richer functional and anatomical context, since it assumes (in accord with recent computational theories of cortex) that problems of partial observability and stimulus history are solved in sensory cortex using statistical modeling and inference and that the TD system predicts reward using the results of this inference rather than raw sensory data. It also accounts for a range of experimental data, including the experiments involving programmed temporal variability and other previously unmodeled dopaminergic response phenomena, which we suggest are related to subjective noise in animals' interval timing. Finally, it offers new experimental predictions and a rich theoretical framework for designing future experiments.
Holes in joins
Authors: Jarek Gryz, Dongming Liang
Venue: Journal of Intelligent Information Systems (2006)

A join of two relations in real databases is usually much smaller than their Cartesian product. This means that most of the combinations of tuples in the crossproduct of the respective relations do not appear together in the join result. We characterize these combinations as ranges of attributes that do not appear together. We sketch an algorithm for finding such combinations and present experimental results from real data sets. We then explore two potential applications of this knowledge in query processing. In the first application, we model empty joins as materialized views, we show how they can be used for query optimization. In the second application, we propose a strategy that uses information about empty joins for an improved join selectivity estimation.
Gray Image Recognition Using Hopfield Neural Network With Multi-Bitplane and Multi-Connect Architecture
Authors: Kussay N. Mutter, Imad I. Abdul Kaream, Hussein A. Moussa
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

In this work, a method for applying Hopfield Neural Network (HNN) with gray images is presented. Hopfield networks are iterative Auto-Associative networks consisting of a single layer of fully connected processing elements thus categorizes as an associative memory. Associative memories provide one approach to the computer-engineering problem of storing and retrieving data which is based on content rather than storage address. HNN deals with the bipolar system (i.e. -1 and +1) for direct input data, however it is useful for binary images, but unuseful for gray-level or color images unless we suppose another way for input data of such images. To overcome this obstacle, one can suppose for 8-bit gray-level image that consists of 8-layers (bitplanes) of binaries can be represented as bipolar data. In this way it is possible to express each bitplane as single binary image for HNN. The experimental results showed the usefulness of using HNN in gray-level images recognition with good results. Furthermore, there are no limitations to the number of 8-bit gray level images that can be stored in the net memory with the same efficient results.
Measuring and extracting proximity in networks
Authors: Yehuda Koren, Stephen C. North, Chris Volinsky
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity between nodes in networks. We propose a new way of measuring and extracting proximity in networks called "cycle free effective conductance"(CFEC). Our proximity measure can handle more than two endpoints, directed edges, is statistically well-behaved, and produces an effectiveness score for the computed subgraphs. We provide an efficien talgorithm. Also, we report experimental results and show examples for three large network data sets: a telecommunications calling graph, the IMDB actors graph, and an academic co-authorship network.
Level Set Segmentation Using Statistical Shape Priors
Authors: Ayman S. El-Baz, Aly A. Farag, Hossam Abd El Munim, Seniha E. Yuksel
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

A novel and robust 3-D segmentation approach is proposed using level sets based on shape constraints. The approach depends on both the gray level and shape information. A partial differential equation (PDE) is developed to control the evolution of the level sets. The PDE does not include weighting coefficients to be tuned, overcoming the disadvantages of other PDE approaches. The shape information is gathered from a set of the signed distance maps representing the training data as a histogram of the occurrences of the points inside and outside the object. We use a novel statistical approach to get a probability density function (pdf) for the signed distance map of the points inside and outside and also the distribution of gray level inside and outside the object. The proposed statistical approach is based on modelling the empirical density function (normalized histogram of occurrence) for either the gray level distribution or signed distance map with a linear combination of Gaussians (LCG) with positive and negative components. We modify an Expectation-Maximization (EM) algorithm to deal with the LCGs and also propose a novel EM-based sequential technique to get a close initial LCG approximation for the modified EM algorithm to start with. The pdf's of the signed distance and intensity gray level are embedded in the speed function of the level set specifying the direction of evolution. Experimental results show how the approach is accurate in segmenting different types of 2-D and 3-D data sets including medical images.
Software reliability evaluation in service operation
Authors: Osamu Miyakawa, Yoshihiro Tohma
Venue: Systems and Computers in Japan (2007)

There have been studies of the software reliability growth model based on the hypergeometric distribution model, most of which have been concerned with the testing and debugging process. In this paper, the assumption of a hypergeometric distribution model for software reliability evaluation in service operation is reviewed, and the estimation power of the model is investigated by using actual fault data. It is found that the estimated mean time between failures agrees with the observed value. &copy; 2006 Wiley Periodicals, Inc. Syst Comp Jpn, 38(1): 97&ndash;104, 2007; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10279
Technology fluency discovering adaptability in a diverse learning environment
Authors: Donna DeGennaro
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This paper offers an expanded definition of technology fluency that includes the ability to use technology in and across communities. The study is a qualitative case study of a self-initiated digital divide intervention. Specifically, the intervention described merges privileged students from a private suburban high school (instructors) with inner-city youth from an impoverished neighborhood (learners) in a web-design course. The question for this research asks in what way do technology-experienced instructors bridge local understandings of technology learning to successfully engage technology-novice learners? Using a theoretical framework drawn from cultural sociology, this study examines the development of the instructors' technology fluency by bringing attention to the transformation of instructor schemas and practices as they interact with learners throughout the course. The intention is not only to illuminate the "what and how" of change but also to offer explanations as to why.
Document Layout Analysis and Classification and Its Application in OCR
Authors: Gaurav Gupta, Shobhit Niranjan, Ankit Shrivastava, RMK Sinha
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

Digitization of paper-bound documents is one of the foremost commercial interests worldwide. First step in all such applications is transforming a paper bound document into an electronic document by scanning, subsequently applying to the image OCR to generate textual information from the document image. In this paper we describe our work that acts as a pre-processing stage for OCR application. Automatic document layout extraction and segmentation is done using spatial configuration of various text/image segments represented as bounded boxes; this segmented layout is than analyzed with certain heuristic tests and each segment is assigned labels (title, authors, abstract, body, header, footer etc). This information is than passed on to OCR module as an XML interface, accelerating it's performance by allowing it to label recognized text segments and identifying only those parts of the document which have text resulting saving in computation. Although, the work has been motivated for application to an automated machine translation system preserving the overall document layout, it has a number of other applications such as in information retrieval, search etc. This information is also being used to classify technical documents into three categories which can be extended to any number of classes based on spatial configuration heuristics.
Detecting Critical Nodes for MANET Intrusion Detection Systems
Authors: A. Karygiannis, E. Antonakakis, A. Apostolopoulos
Venue: Proceedings of the Second International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing (2006)

Ad hoc routing protocols have been designed to efficiently reroute traffic when confronted with network congestion, faulty nodes, and dynamically changing topologies. The common design goal of reactive, proactive, and hybrid ad hoc routing protocols is to faithfully route packets from a source node to a destination node while maintaining a satisfactory level of service in a resource-constrained environment. Detecting malicious nodes in an open ad hoc network in which participating nodes have no previous security associations presents a number of challenges not faced by traditional wired networks. Traffic monitoring in wired networks is usually performed at switches, routers and gateways, but an ad hoc network does not have these types of network elements where the Intrusion Detection System (IDS) can collect and analyze audit data for the entire network. A number of neighbor-monitoring, trust-building, and cluster-based voting schemes have been proposed in the research to enable the detection and reporting of malicious activity in ad hoc networks. The resources consumed by ad hoc network member nodes to monitor, detect, report, and diagnose malicious activity, however, may be greater than simply rerouting packets through a different available path. This paper presents a method for determining conditions under which critical nodes should be monitored, describes the details of a critical node test implementation, presents experimental results, and offers a new approach for conserving the limited resources of an ad hoc network IDS.
Reservation Through Image Visualization
Authors: Mohd Ezanee Bin Rusli, Azmi Mohd Yusof, Nazrita Ibrahim
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

In tourism industry, reservation or booking through the Internet is now so common; it is becoming the practice among the big or small industry players. However, what is missing and lacking is the concept of virtual imaging that represent the ongoing transaction. For this paper, the focus is visualizing real time reservation for an island-based vacation area. Up to now, most of the information is conveyed to the customers through plain boring old text or through verbal explanation given by service provider through phone or emailing system. Major frustration is caused by not knowing the exact location of the reserved facility within the particular area. So, this paper will discuss in detail the weakness of current reservation process that can be avoided by applying an improved multimedia management technology through graphics visualization technique.