ppxscal/embedding_network huggingface dataset:
Towards A Collaborative Model Of An Automated Adaptive Content Delivery Training Utilizing Fuzzy Logic
Authors: Gregory Vert, Rajasekhar Yakkali
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

Rapid advances in internet technologies have opened gateways new types of collaborative systems and for specialized educational opportunities. These range from online distance learning for individuals as well as for those who want to learn a certain skill set, courses for which may not be offered in traditional educational institutions. Although these web-based courses have become major global education contributors in overcoming the basic education challenges of the traditional classroom environment, they do not consider the fact that each individual can learn differently. Some students are auditory learners, and some may be visual learners while others may be kinesthetic learners. Adaptive learning systems address this aspect of different learning styles and the need to customize learning instruction. However individual learners progress partly as a function of the content being developed by an instructor. Therefore there is a need for a collaborative system that can let an instructor know how learners are progressing and thus the instructor can modify and disperse near real-time course content if learners are struggling with current content. Such systems provide an innovative method of instruction that adapts to the learner's unique learning style. A model of a novel approach to collaborative adaptive learning is presented that utilizes learning modalities of instruction tailored to individual needs. At the heart of this approach is a fuzzy neural network (FNN) that evaluates comprehension makes instructional modality selections and collaborates with an instructor in tailoring course content.
QoS-aware Scheduling Algorithm Based on Complete Matching of User Jobs and Grid Services
Authors: Weidong Hao, Yang Yang, Chuang Lin, Zhengli Zhai
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Grid Services Scheduling is a challenging problem under Open Grid Service Architecture(OGSA). Grid Services running on Clusters must have mechanism and policies for establishing and supporting QoS. A graph theory formal description is introduced into the Service Grid Model in this paper. The necessary and sufficient condition of complete matching of user job and service resources has been given and proved. Optimal Solution to matchmaking of grid jobs and grid services is developed based on the running time weight matrix, and the arithmetic has been verified by simulation analysis which proved to be more efficient than the alike arithmetic. The arithmetic has been implemented and running well.
A Smith-Waterman Local Alignment Approach for Spatial Activity Recognition
Authors: Daniel E. Riedel, Svetha Venkatesh, Wanquan Liu
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

In this paper we address the spatial activity recognition problem with an algorithm based on Smith-Waterman (SW) local alignment. The proposed SW approach utilises dynamic programming with two dimensional spatial data to quantify sequence similarity. SW is well suited for spatial activity recognition as the approach is robust to noise and can accommodate gaps, resulting from tracking system errors. Unlike other approaches SW is able to locate and quantify activities embedded within extraneous spatial data. Through experimentation with a three class data set, we show that the proposed SW algorithm is capable of recognising accurately and inaccurately segmented spatial sequences. To benchmark the techniques classification performance we compare it to the discrete hidden markov model (HMM). Results show that SW exhibits higher accuracy than the HMM, and also maintains higher classification accuracy with smaller training set sizes. We also confirm the robust property of the SW approach via evaluation with sequences containing artificially introduced noise.
A Methodology for Use Cases Modeling Based on Sequence Diagrams Quantification
Authors: J. Reyes Juarez, Karla C. Barraza, Guillermo Licea, Alfredo Cristobal-Salas
Venue: Proceedings of the 19th Conference on Software Engineering Education and Training Workshops (2006)

In this paper we describe a methodology to model a use case using sequence diagrams quantification. Our methodology consists in a set of metrics to define the amount of scenarios, and it determines the use case goal accomplishment based on the occurrence, sequence order, and the flow of data involved in. It also helps to obtain a robust design because all possible flows are considered; by this way, software quality could be achieved in quantitative terms. This approach can be used in two ways: to define a complete set of scenarios before entering in the design phase, and to measure design quality in terms of completeness and functionality attributes. Our methodology follows the main recommendations to apply a solid mathematical basis for engineering careers, and informatics and computing programs.
Compiler-in-the-loop exploration of programmable embedded systems
Authors: Nikil D. Dutt
Venue:  (2006)

Increasing complexity of embedded systems, and shortening time-to-market makes designer productivity the key concern in embedded system development. As a result Programmable Embedded Systems---that have a programmable processor and memory subsystem to support the software part of the application---are becoming an attractive platform for embedded system design. Programmable embedded systems greatly enhance design reuse, reduce the complexity, and time-to-market via software. The application-specific, strict, multi-dimensional design constraints, result in embedded processor designs being highly customized. Embedded processors often feature design idiosyncracies, custom-algorithms, and sometimes even miss some architectural features. Consequently, code generation for the embedded processors is a challenging task. However, if the compiler is able to exploit the architectural features of the embedded processors, it can make a tremendous difference in the power, performance, etc. of the eventual system. Existing embedded system design/exploration techniques either do not consider compiler effects on the design, or include the compiler effects in an ad-hoc manner, which may lead to inaccurate evaluation of design choices and therefore result in suboptimal design decisions. This thesis proposes a Compiler-in-the-Loop Exploration approach, a systematic method to include compiler effects during architectural evaluation of embedded systems. This dissertation demonstrates the need and usefulness of the proposed methodology at several levels of embedded system design abstraction: at the instruction set architecture level, at the processor pipeline design level, at the memory design level, and at the processor-memory interface level. At each level of design abstraction, this dissertation demonstrates that the proposed methodology results in a more meaningful exploration of design space leading to better design decisions with respect to the design goals of performance, code size, energy and power consumption.
RWBO(pd,w): a novel backoff algorithm for IEEE 802.11 DCF
Authors: Yun Li, Ke-Ping Long, Wei-Liang Zhao, Feng-Rui Yang
Venue: Journal of Computer Science and Technology (2005)

The Probability Distribution of Slot Selection (PDoSS) of IEEE 802.11 DCF is extremely uneven, which makes the packet collision probability very high. In this paper, the authors explore how to make the stations select the slots uniformly, and give an RWBO(pd, w) algorithm for 802.11 DCF to make the PDoSS even and decrease the packet collision probability. A Markov model is given to analyze the PDoSS of RWBO(pd, w). The performance of RWBO(pd, w) is evaluated by simulation in terms of saturation throughput and packet collision probability. The simulation results indicate that RWBO(pd, w) can decrease the packet contention probability to a large extent, and utilize the channel more efficiently as compared to the 802.11 DCF. Moreover, the relation between saturation throughput and walking probability (pd), the relation between saturation throughput and contention windows (w), the relation between packet collision probability and walking probability (pd), and the relation between packet collision probability and contention windows (w) are analyzed. The analysis indicates that RWBO(pd, w) has some remarkable features: its saturation throughout keeps high and packet collision probability keeps very low (under 0.1) in a large range of pd and w, which allow users to configure pd and w more flexibly.
Call Stack Coverage for GUI Test-Suite Reduction
Authors: Scott McMaster, Atif Memon
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

Graphical user interfaces (GUIs) are used as frontends to most of today's software applications; testing GUIs for functional correctness is needed to ensure the overall correctness of these applications. The eventdriven nature of GUIs presents new challenges for testing. One important challenge is test suite reduction. Conventional reduction techniques/tools based on static analysis are not easily applicable due to the increased use of multi-language GUI implementations, callbacks for event handlers, virtual function calls, reflection, and multi-threading. Moreover, many existing techniques ignore event handlers from libraries, and fail to consider the context in which a handler executes. Consequently, they yield GUI test suites with seriously impaired fault-detection ability. This paper presents a new reduction technique based on the call stack coverage criterion. Call stacks may be collected for any executing program with very little overhead. An empirical study involving three large GUI-based applications shows that call stack based reduction provides an excellent tradeoff between reduction in test suite size and loss of fault-detection effectiveness.
Set estimation via ellipsoidal approximations
Authors: A. Sabharwal, L. C. Potter
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

In most estimation and design problems, there exists more than one solution that satisfies all constraints. In this paper, we address the problem of estimating the complete set of feasible solutions. Multiple feasible solutions are frequently encountered in signal restoration, image reconstruction, array processing, system identification and filter design. An estimate of the size of the feasibility set can be utilized to quantitatively evaluate inclusion and effectiveness of added constraints. Further, set estimation can be used to determine a null feasibility set. We compute ellipsoidal approximations to the set of feasible solutions using a new ellipsoid algorithm and the method of analytic centers. Both algorithms admit multiple convex constraint sets with ease. Also, the algorithms provide a solution which is guaranteed to be in the interior of the feasibility set.
A framework for integration model of resource-constrained scheduling using genetic algorithms
Authors: Jin-Lee Kim, Ralph D. Ellis,  Jr.
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The objective of this paper is to present an optimal algorithm for a resource allocation model, which would be implemented into a framework for the development of an integration model. Unlike present heuristic-based resource allocation models, the model does not depend solely on a set of heuristic rules, but adopts the concept of future float to set the order of priority when activities compete for resources. The model determines the shortest duration by allocating available resources to a set of activities simultaneously. Genetic algorithms (GAs) are adopted to search optimal solutions. The results obtained from a case example indicate that the model is capable of producing optimal scheduling alternatives, compared to a single solution that is produced by either the total float model or the least impact model.
Clustering Web Documents Based on Correlation of Hyperlinks
Authors: Kou TAKAHASHI, Takao MIURA, Isamu SHIOYA
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

In this investigation, we propose a new Web clustering approach based on combining cluster results.
A Design and Operation Model for Agent-Based Flexible Distributed System
Authors: Akiko Takahashi, Tetsuo Kinoshita
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

In this paper, we propose a new scheme for observing and controlling behavior of the QoS(Quality of Service)- aware agent organization, which provides a flexible QoS control of multimedia service components. In particular we propose two models, i.e., Flexible Distributed System (FDS) Model and its Behavioral Characteristics Model (BCM) in this paper. By using these two models, a multiagent system with the flexible QoS control capability that can deal with changes of system's operational situations to maintain the required QoS as well as its behavioral characteristics.
The expert novice
Authors: Bobbie Turniansky, Dina Friling
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

The central proposal of this paper is that the novice experience is critical to the learning process of groups as well as individuals. How do "experts" become "novices" and move in directions that require them to put aside their theories of action? How does a group of experts collectively accomplish that? From our experiences as members of the ACE teacher educator team, and the research we have done on the team over the past three years, we propose that not only is the novice state of mind essential for professional development, change, and creativity, it also enables the teacher educator to empathize with students' experiences of being novices. We propose a new way of looking at the term "professional development" which suggests that "novice" is not the opposite of "expert". These two states are not different sides of the same continuum - they can exist simultaneously.
Wormhole-Based Antijamming Techniques in Sensor Networks
Authors: Mario Cagalj, Srdjan Capkun, Jean-Pierre Hubaux
Venue: IEEE Transactions on Mobile Computing (2007)

Due to their very nature, wireless sensor networks are probably the category of wireless networks most vulnerable to "radio channel jamming”-based Denial-of-Service (DoS) attacks. An adversary can easily mask the events that the sensor network should detect by stealthily jamming an appropriate subset of the nodes; in this way, he prevents them from reporting what they are sensing to the network operator. Therefore, even if an event is sensed by one or several nodes (and the sensor network is otherwise fully connected), the network operator cannot be informed on time. We show how the sensor nodes can exploit channel diversity in order to create wormholes that lead out of the jammed region, through which an alarm can be transmitted to the network operator. We propose three solutions: The first is based on wired pairs of sensors, the second relies on frequency hopping, and the third is based on a novel concept called uncoordinated channel hopping. We develop appropriate mathematical models to study the proposed solutions.
Image Watermarking Robust to Print and Generation Copy
Authors: Ping Chen, Yao Zhao, Jeng-Shyang Pan
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In general, after a watermarked image is printed, copied several times and scanned, the watermark usually cannot be extracted rightly, as well as distorted by noise. To solve this problem, in this paper, two watermarks were embedded into the image. The first one is a periodic watermark. The second one is the real watermark message. These two watermarks are embedded into the image by modifying the gray value of each pixel. The cover image is not needed when the watermark is detected. Both of these two watermarks are estimated exploiting the properties of HVS (Human Visual System) and extracted through the same key-dependent 2D sequences. Experiments results show that the scheme can resist print, generation copy and scan process.
RFID Authentication Protocol Using ID Synchronization in Insecure Communication
Authors: Jang-Su Park, Im-Yeong Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

It has been estimated that 'RFID' technology would be playing an important role in the incoming ubiquitous environment. For this reason, many studies on 'RFID' have been conducted and its application has been on the increase in various fields such as finance, medicine, transportation and culture as well as in logistics distribution. However, the communication between Tag and Reader in RFID system has been conducted by wireless communication of radio frequency so that the information on identification could be eavesdropped by the third party maliciously. Such eavesdropped information could be also used as basic information in attaching others; in this regard, it could impair the privacy of its users and the users have avoided using 'RFID.' Therefore, many studies have been performed and the output of Tag has been varied by means of renewing the ID in order to solve such a problem. However, the synchronization of the renewal between database and Tag should be done in the ID renewal process.
Connected Shape-Size Pattern Spectra for Rotation and Scale-Invariant Classification of Gray-Scale Images
Authors: Erik R. Urbach, Jos B. T. M. Roerdink, Michael H. F. Wilkinson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

In this paper, we describe a multiscale and multishape morphological method for pattern-based analysis and classification of gray-scale images using connected operators. Compared with existing methods, which use structuring elements, our method has three advantages. First, in our method, the time needed for computing pattern spectra does not depend on the number of scales or shapes used, i.e., the computation time is independent of the dimensions of the pattern spectrum. Second, size and strict shape attributes can be computed, which we use for the construction of joint 2D shape-size pattern spectra. Third, our method is significantly less sensitive to noise and is rotation-invariant. Although rotation invariance can also be approximated by methods using structuring elements at different angles, this tends to be computationally intensive. The classification performance of these methods is discussed using four image sets: Brodatz, COIL-20, COIL-100, and diatoms. The new method obtains better or equal classification performance to the best competitor with a 5 to 9-fold speed gain.
Automated argument system based on logic of multiple-valued argumentation
Authors: Toshiko Wakaki, Takanori Mukai, Hiromitsu Miyashita, Hajime Sawamura, Kumiko Matsunaga, Taro Fukumoto, Katsumi Nitta
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We demonstrate the basic features and advantages of Automated Argument System based on Logic of Multiple-Valued Argumentation by applying it to three convincing arguments: (i) Argument-based recommender system, (ii) Schedule management system and (iii) An integrated system of semantic web reasoning and argument-based reasoning.
NPAR by Example: Line Drawing Facial Animation from Photographs
Authors: Yuan Luo, Marina L. Gavrilova, Mario Costa Sousa
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

This paper presents a new method for generating nonphotorealistic (NPR) facial expression animations. The method consists of two main processing parts. First, a particular NPR style portrait is created from a frontal facial photograph. Facial expressive details, like: expressive wrinkles,fine creases, even freckles, can be included in the synthesized portrait, which makes it more expressive. Second, with two different facial expression portraits, a metamorphing algorithm using distance transform is utilized to produce the 2D animation. Our morphing process is fully automated, no control point or any manual work is required. Finally, a continuous facial expression animation is produced. The resulted animation is useful in a number of potential applications, ranging from entertainment and education to teleconferencing and psychology research.
Biomimetic design and fabrication of tissue engineered scaffolds using computer aided tissue engineering
Authors: Wei Sun
Venue:  (2006)

The field of tissue engineering brings together the multidisciplinary research of life sciences and engineering to seek man-made substitutes for the regeneration of damaged tissue or organs. A key component in tissue engineering is the use of porous scaffolds to guide cells for attachment, proliferation and differentiation in the tissue regenerative process. Upon satisfactory in-vitro culture, this engineered living scaffold is implanted into the regeneration site of the patient to function as the tissue substitute. Conventional processing techniques for the fabrication of scaffolds often encounter difficulties in the precise control of the internal architecture, interconnectivity and distribution of pores within the scaffold. These challenges, along with the advances in biology, medicine, and information technology for tissue engineering applications, have led to the development of a new field of Computer Aided Tissue Engineering (CATE). CATE enables a systematic application of computer-aided technologies, i.e., computer-aided design (CAD), image processing, computer-aided manufacturing (CAM), and solid freeform fabrication (SFF) for modeling, designing, simulation, and manufacturing of biological tissue and organ substitutes. Through the use of CATE, the design of intricate three dimensional architecture of scaffold can be realized and these scaffolds can be fabricated with reproducible accuracy to assist biologists in studying complex tissue engineering problems. This thesis reports a research addressing some of the challenges in applying the CATE approach for the biomimetic design and freeform fabrication of tissue scaffolds. The major research accomplishments reported in this thesis include: (a) The development of a BioCAD modeling technique for the design and representation of patient specific 3D tissue models based on non-invasive medical image data. (b) The development of a biomimetic design approach for design of load bearing tissue scaffold subject to multiple biophysical, geometrical and manufacturing requirements. This includes the design of the unit cell micro-architecture based on tissue morphologies, unit cell characterization and evaluation of the mechanical and transport properties, and the use of unit cells as building block to design anatomic tissue scaffold replacements. (c) The development of a CAD based path planning procedure through a direct slicing algorithm which can convert a neutral ISO (International Standards Organization) standardized STEP (Standard for the Exchange of Product Data) formatted NURBS (Non-Uniform Rational B-Spline) geometric representation to a tool path instruction set for layered freeform fabrication. (d) The development of a novel Internal Architecture Design (IAD) approach for the mapping of characteristic patterns of the unit cell micro-architectures designed within the 3D scaffold. (Abstract shortened by UMI.)