ppxscal/embedding_network huggingface dataset:
Clubs, homes, and online communities as contexts for engaging youth in technology fluency building activities
Authors: Brigid Barron, Yasmin B. Kafai
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

The goal of this session is to advance our understanding of the relationships between access to computing tools, learning opportunities, and the development of technological fluency. Understanding variability in the kinds of material and social resources that children have access to is crucial for a better understanding of how to create more equitable learning opportunities. Overview talks of three research programs and their theoretical frameworks will start this session. A poster session will follow that showcases nine empirical or design projects that have emerged from the research programs. In keeping with the conference theme, the overview presentations and empirical work highlight how learning to use technology in empowered ways can be nurtured within and across a broad range of contexts.
Stability of information stored in nanoscopic arrays of ferromagnetic posts
Authors: Artur Kaczanowski, Krzysztof Kułakowski
Venue: Microelectronic Engineering (2005)

The damage spreading technique is applied to discuss the stability of the magnetic structure of nanoscopic arrays of monodomain ferromagnetic posts. Simulations are performed with the Pardavi-Horvath algorithm. The stability is considered on a plane (@s,H"a), where @s is the dispersion of the coercive field of the posts, and H"a is the amplitude of an applied, slowly varying sinusoidal magnetic field. The phase diagrams on stability are obtained for square lattices and triangular lattices. In both cases, areas are found where the stability is lost.
M-Quiz by SMS
Authors: Mohammad Shirali Shahreza
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Virtual learning is a new idea that has gotten a new form with the emergence of new technologies such as the wireless networks. The mobile phone (cell phone) is a device that is used by most people nowadays. Therefore, one can use the mobile phone for virtual learning on a wide scale. One of the popular and at the same time simple and inexpensive services on the mobile phone is the SMS (Short Message Service). In this paper I propose a method for taking multiplechoice quizzes by using the SMS on mobile phones. In the provision of these tests, some SMS messages were sent to the student along with the answers of the questions, which were steganography in an image. The student, after receiving and answering to the questions, receives his grade at the client-side and then the grade is hidden in an SMS picture message and sent back to the instructor. Moreover, the correct answers of the questions are destroyed within the image after they are extracted from image so as to eliminate the possibility of any cheating. The instructor also, after receiving the image and extracting the grade, records the student's grade. Because of using the steganography method in sending the answers and grade, this method is highly secure and the possibility of cheating in the grade is reduced. his method was implemented with the J2ME language on a Nokia 6680 mobile phone.
On applying network coding to underwater sensor networks
Authors: Zheng Guo, Peng Xie, Jun-Hong Cui, Bing Wang
Venue: Proceedings of the 1st ACM international workshop on Underwater networks (2006)

High error rates and long propagation delays in underwater sensor networks call for efficient error-recovery schemes. We believe network coding is a promising technique for this purpose because of the broadcast nature of acoustic channels and computation capabilities at the sensor nodes. In this paper, we design a network coding scheme for underwater sensor networks and explore its performance through simulation. Our initial results indicate the benefits of using network coding for error recovery and the gains from coding at the source.
Using Branch Correlation to Identify Infeasible Paths for Anomaly Detection
Authors: Xiaotong Zhuang, Tao Zhang, Santosh Pande
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

In this paper, we propose a system called Infeasible Path Detection System (IPDS) to combat memory tampering attacks causing invalid program control flows. In our system, the compiler analyzes correlations between branches and then the analyzed information is conveyed to the runtime system. The runtime system detects dynamic infeasible program paths by combining compiler determined information with runtime information to check the legality of the path taken during execution. IPDS achieves a zero false positive rate and can detect a high percentage of memory tampering for many attacks in which the tampering actually causes a change in control flow. Moreover, IPDS only incurs a modest amount of hardware resource and negligible performance penalty.
Agile Decision Agent for Service-Oriented E-Commerce Systems
Authors: Jiyong Zhang, Pearl Pu, Boi Faltings
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

In a service-oriented e-commerce environment, it is a crucial task to help consumers choose desired products efficiently from a huge amount of dynamically configured product candidates. Decision agents can be designed to provide interactive decision aids for end-users by eliciting their preferences and then recommending matching products. In reality the users' preferences may keep changing along with the dynamic decision environment and may not be fully satisfied. As a result, the decision agent is required to be agile: it should allow decision making with an incomplete user's preference model and should afford users to add, retract or revise their various preferences with little effort. In this paper we propose the general design of an agile decision agent to meet this need. We model users' preferences with the soft constraint technique and elicit them by the example critiquing interaction paradigm.
BM-ALM: An Application Layer Multicasting with Behavior Monitoring Approach
Authors: Dewan Tanvir Ahmed, Shervin Shirmohammadi
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

IP multicasting is the most efficient way to perform group data distribution, as it eliminates traffic redundancy and improves bandwidth utilization. Application Layer Multicast (ALM) has been proposed to overcome some of the limitations in IP multicasting such as scalability and deploy-ability. Limited computing power, scarcity of bandwidth and end-host's reluctance to share bandwidth make ALM difficult to spread. In this paper, we keep eye to those problems and present an ALM that scrutinizes the commitment of the ALM nodes. Failure to provide quality of service agreement triggers performance penalty for the node in concern. Thus, every node has an obligation to its descendants; as a result, a nice collaboration among the end-hosts is achieved for group communication. It has good performance for content distribution, as it reflects physical network topology onto the overlay network constructed by the end-hosts. Tree refinement and backup path strategies are taken to better satisfy heterogeneous QoS requirements.
An Authoring Tool for Adaptative Assessment Items
Authors: Hector Barbosa Leon, Francisco Garcia Penalvo
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

In this article, we want to define an authoring tool to set adaptive assessment items. We present our model divided in four main sections from the definition of the item to the delivery to the Learning Management System, inside each section, we describe up to three levels of conceptualization, showing the specifications and software packages to be used. Also we describe our process to implement the authoring tool, including a brief description to include accessibility and adaptation characteristics for the assessment items.
Effectiveness of Collaborative e-Test Construction
Authors: Pokpong Songmuang, Maomi Ueno, Toshio Okamoto
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper focuses on one of the features of e-testing, which has not been discussed until now, collaborative test construction by several test-authors in distant places. It is well known that collaborative work has many advantages. The main idea of this paper is to apply the unique advantages of collaborative work to e-test construction. The purpose of this paper is to identify the important factors in constructing high-quality tests. It does this by comparing test reliabilities and validities based on test theory for tests constructed by different numbers of test-authors (one, three, and five) with and without the experts of the test domain. The results show that the number of test-authors is the most important factor in improving test validity. They also show that test reliability does not depend on the number of test-authors but rather on the participation of an expert.
A statistical study of a regularized method for long auto-regressive spectral estimation
Authors: J.-F. Giovannelli, G. Demoment
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors address the problem of power spectral density estimation of time series with auto-regressive (AR) models when only a short span of data is available for analysis. The AR coefficients are estimated through a regularized method proposed by G. Kitagawa and W. Gersch (1985). An experimental study of this method and a comparison with the classical least squares (LS) method are outlined. The principles of the statistical study and computation results are presented.
Visual Imagery in Hemianopic Patients
Authors: Joystone Gbadamosi, Wolfgang H. Zangemeister
Venue: Journal of Cognitive Neuroscience (2001)

In this article we report some findings about visual imagery in patients with stable homonymous hemianopia compared to healthy control subjects. These findings were obtained by analyzing the gaze control through recording of eye movements in different phases of viewing and imagery. We used six different visual stimuli for the consecutive viewing and imagery phases. With infrared oculography, we recorded eye movements during this presentation phase and in three subsequent imagery phases in absence of the stimulus. Analyzing the basic parameters of the gaze sequences (known as "scanpaths"), we discovered distinct characteristics of the "viewing scanpaths" and the "imagery scanpaths" in both groups, which suggests a reduced extent of the image within the cognitive representation. We applied different similarity measures (string/vector string editing, Markov analysis). We found a "progressive consistency of imagery," shown through raising similarity values for the comparison of the late imagery scanpaths. This result suggests a strong top-down component in picture exploration: In both groups, healthy subjects and hemianopic patients, a mental model of the viewed picture must evolve very soon and substantially determine the eye movements. As our hemianopic patients showed analogous results to the normal subjects, we conclude that these patients are well adjusted to their deficit and, despite their perceptual defect, have a preserved cognitive representation, which follows the same top-down vision strategies in the process of visual imagery.
Generating k-best solutions to auction winner determination problems
Authors: Terence Kelly, Andrew Byde
Venue: ACM SIGecom Exchanges (2006)

Auction participants cannot always articulate their requirements and preferences. Sometimes, for instance, the buyer in a procurement auction cannot quantify the value of non-price solution attributes or delineate between hard and soft constraints. This precludes formulating the winner determination problem (WDP) as an optimization problem. Existing decision-support aids for such situations extend an optimization framework. We present an approach that frames the decision problem as one of exploration rather than optimization. Our method relies on an algorithm that generates k-best solutions to auction WDPs. Our algorithm can incorporate hard constraints into the generation process and can scale to practical procurement auctions. We show how to extract useful guidance from k-best WDP solutions, and we evaluate our method using real bids submitted by real suppliers in an HP material parts procurement auction.
Practical Verification of Component Substitutability Using Subtype Relation
Authors: Premysl Brada, Lukas Valenta
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

The flexibility which components provide for assembling applications makes them an appealing solution to many engineering problems. Its darker side is the need to exercise much greater care when replacing and upgrading components within deployed applications, to ensure their stability. Formally strong methods for substitutability checks are therefore desirable but so far, not many are practically used. This paper presents a method of checking component substitutability based on subtyping relation. It uses a representation of the subtype evaluation on different levels of the component type structure, and makes it possible to perform the checks simply by comparing this representation. Two usage scenarios are described, as well as experiences from a prototype implementation for mainstream platforms.
Experiments Study for Scientific Texts Domain Keyword Acquisition
Authors: Xiangfeng Luo, Ning Fang, Weimin Xu, Sheng Yu, Kai Yan, Huizhe Xiao
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Scientific texts domain keyword is one of the basic elements of the text high-level semantics acquisition, domain ontology building and the knowledge representation in semantic grid, knowledge grid and escience environment. It is also the indispensable foundation and prerequisite work of Web scientific texts automatic classification, clustering and personalized services. TFIDF based TDDF formula is proposed to extract scientific texts domain keyword. The experiments proved that TDDF formula extracting texts domain keyword is superior to the classic TFIDF formula does. Above discussions and achievements can provide certain support not only for the establishment of semantic grid, knowledge grid and escience environment, but also for the Web knowledge acquisition, representation and text information retrieval and so on.
Efficient parameter estimation of partially polarized electromagnetic waves
Authors: Jian Li, P. Stoica
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

This paper considers the problem of statistically efficient estimation of the parameters of partially polarized electromagnetic (EM) waves with a uniform linear array of crossed dipoles. We consider the maximum likelihood (ML) estimation of incident angles and the degrees of polarization. We present a computationally efficient large sample ML estimator that avoids the multidimensional search over the parameter space required by the exact ML estimator.
Integrated resource planning model
Authors: Richard Rinehart, Reid Kress, Tom Insalaco, Janice Atwater, Jack Dixon
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The Integrated Resource Planning Model (IRPM) is a decision support tool for dynamic rough-cut resource and capacity planning. The IRPM evaluates the impact of rapidly changing schedules, variable budgets, and a changing resource base including personnel, equipment, and facilities and their effects on schedule performance, projected cost, and resource utilization. While the IRPM has been developed with a powerful embedded Supply Chain simulation model as its solution engine, it employs an easy to use graphical user interface for the novice analyst. The key source of data for the model is program and project schedules and associated resource and material connectivity information. The IRPM has been demonstrated successfully at the Y-12 National Security Complex in Oak Ridge, Tennessee, on a large program and on a simple demonstration model of a bicycle refurbishment/manufacturing facility. This demonstration will highlight the simulation model, the user interface, and the intercommunications between the two.
An Electrophysiological Analysis of the Time Course of Conceptual and Syntactic Encoding during Tacit Picture Naming
Authors: Bernadette M. Schmitt, Kolja Schiltz, Wanda Zaake, Marta Kutas, Thomas F. Münte
Venue: Journal of Cognitive Neuroscience (2001)

A central question in psycholinguistic research is when various types of information involved in speaking (conceptual/semantic, syntactic, and phonological information) become available during the speech planning process. Competing theories attempt to distinguish between parallel and serial models. Here, we investigated the relative time courses of conceptual and syntactic encoding in a tacit picture-naming task via event-related brain potential (ERP) recordings. Participants viewed pictures and made dual-choice go/no-go decisions based on conceptual features (whether the depicted item was heavier or lighter than 500 g) and syntactic features (whether the picture's German name had feminine or masculine syntactic gender). In support of serial models of speech production, both the lateralized readiness potential, or LRP (related to response preparation), and the N200 (related to response inhibition) measures indicated that conceptual processing began approximately 80 msec earlier than syntactic processing.
Three-Dimensional Object Recognition using Multiplex Complex Amplitude Information with Support Function
Authors: Nobukazu Yoshikawa, Yukie Ii
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

We propose a three-dimensional (3D) object recognition method using multiplex complex amplitude with a support function. 3D shape information of an object is directly encoded into the phase factor of the complex amplitude by the Fourier transform profilometry technique. The support function determined on the basis of the amplitude factor of the complex amplitude can remove unnecessary background or unreliable areas of the object due to low reflectance. For robust object recognition, the reference data is produced by spatial shift multiplexing of complex amplitudes derived from many parallax views. Object recognition is performed by correlation between the multiplex reference data and the target object at a single operation. In the experiment, we confirm 3D object recognition using the multiplex reference data including many objects with various rotation angles.
Low-complexity soft decoding algorithms for reed-solomon codes
Authors: Aleksandar Kavcic
Venue:  (2006)

Two approaches to soft decoding of Reed-Solomon Codes (of block length n) are presented. The first procedure is an algebraic, Chase-type, technique which first produces a set of test-vectors that are equivalent on all except h&Lt;n coordinate positions. The similarity of the test-vectors is utilized to reduce the complexity of interpolation, the process of constructing a set of polynomials that obey constraints imposed by each test-vector. By first considering the equivalent indices, a polynomial common to all test-vectors is constructed. The required set of polynomials is then produced by interpolating the final &eta; dissimilar indices utilizing a binary-tree structure. In the factorization step, a candidate message is extracted from each interpolation polynomial. Although an expression for the direct evaluation of each candidate message is provided, carrying-out this calculation for each polynomial is extremely complex. Thus, a novel, reduced-complexity, methodology is also given. Although suboptimal, simulation results affirm the loss in performance incurred by this procedure is decreasing with code length, and negligible for long (n > 100) codes. Significant coding gains are shown to be achievable over traditional hard-decision decoding procedures at a comparable computational complexity. These gains are, furthermore, shown to be similar to recently proposed algebraic techniques that bear a significantly more complex implementation than the proposed algorithm. The second proposed technique is an iterative methodology that applies the output of subsequent iterations of Belief-Propagation (BP) as input to a legacy decoding algorithm. However, due to the suboptimal performance of BP conducted on the inherently dense Reed-Solomon parity-check matrix, a method is provided to construct reduced-density, binary, parity-check equations. Iterative decoding is then implemented by (1) utilizing a subset of a redundant set of parity-check equations to minimize the number of connections into the least-reliable bits or (2) augmenting the parity-check matrix with phantom-checks that, when added to existing rows, maximally improve the structure of the resulting graph. Simulation results show that performance comparable to the best known Reed-Solomon decoding techniques is achievable with these methodologies. However, unlike these existing procedures, the architecture of the proposed algorithm allows for a practical implementation in hardware.
An Efficient Feature Based Matching Algorithm for Stereo Images
Authors: Bo Tang, Djamel Ait-Boudaoud, Bogdan J. Matuszewski, Lik-kwan Shark
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

A novel efficient feature based stereo matching algorithm is presented in this paper. The proposed method links the detected feature points into chains and the matching process is achieved by comparing some of the feature points from different chains. A matching score based on 2 Dimensional Normalised Cross Correlation (2D NCC) is used to determine whether feature points are well matched to construct a feature correspondence. This process improves the reliability and the efficiency of the algorithm by concentrating on matching corresponding chains. The proposed method is tested and validated using real scenes and synthetic data images. Experimental results indicate that this novel algorithm is more reliable especially for images in which a number of vertical features are detected. It also compares well with existing methods in terms of speed of execution.
Discrete Modelling of the Ethylene-Pathway
Authors: Claudia Taubner, Till Merker
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Arabidopsis thaliana is a small flowering plant that is widely used as a model organism in plant biology. We describe here the Ethylene-Response Pathway (Ethylene- Pathway) whose is belong to the signal transduction pathways. The knowledge of the signaling pathways are still incomplete and discrete modelling has been shown to help a better understanding of the underlying mechanisms. In this paper we provide a brief introduction to the Ethylene- Pathway and describe two approaches - UML-Statecharts and Life Sequence Charts (LSC) - in discrete modelling of the signaling pathway.
Backward representation of Markov jump processes and related problems. II. Optimal nonlinear estimation
Authors: A. V. Borisov
Venue: Automation and Remote Control (2006)

Solutions of the problem of optimal nonlinear smoothing (interpolation) of the state of a special Markov jump process from indirect observations in Wiener noise were obtained. The optimal nonlinear estimates were examined and compared with the corresponding optimal linear estimates described in Part I.