ppxscal/embedding_network huggingface dataset:
A Look at the Roles of Look & Roles in Embodied Pedagogical Agents - A User Preference Perspective
Authors: Magnus Haake, Agneta Gulz
Venue: International Journal of Artificial Intelligence in Education (2009)

The paper presents a theoretical framework addressing three aspects of embodied pedagogical agents: visual static appearance, pedagogical role, and communicative style. The framework is then applied to a user study where 90 school children (aged 12-15) in a dummy multimedia program were presented with either an instructor or a learning companion condition. They were then to choose between eight visually different embodied pedagogical agents: four more naturalistic (detailed & 3D-rendered) and four more stylized (simplified & cartoonish). Finally the participants were to choose between a strictly task-oriented versus a task- and relationoriented pedagogical agent. The goal of the study was to explore possible relations between the three aspects mentioned above with respect to user preferences. Results were: (i) when the agent was introduced as a learning companion, female students displayed a significant tendency to choose a more stylized visual character, (ii) when the agent was introduced as a learning companion, female students displayed a significant tendency to choose a task- and relation-oriented agent, and (iii) in the case when students had chosen a more stylized character, there was a significant tendency to choose a task- and relation-oriented agent. The paper also discusses limitations and strengths of the study, and advocates careful descriptions in studies of this kind - especially regarding the notion of visual realism.
Study of a Novel Zoom Spectrum Analysis Approach for Wireless Communication Analyzer
Authors: Jin Yanhua, Li Gun, Qin Kaiyu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

To perform FFT-based measurement in wireless communication analyzer, the frequency range and resolution on the x-axis of a spectrum plot depend on the sampling rate and the number of points acquired. However, the sampling rate of the acquisition front end is fixed in wireless communication analyzer, which implies a large size FFT to be used for getting high frequency resolution. On the other hand, it is necessary that the analysis range and the frequency resolution can be set by user. Aiming to solve these problems, a programmable zoom spectrum analysis method with multistage filtering technique is presented in this paper. The zoom FFT technique is investigated firstly, and then the key process is discussed in detail, such as the complex modulation, decimation filter and down-sampling. Especially a practical scheme of programmable multistage decimation in wireless communication analyzer has been given. Finally, the simulation results indicate that the frequency spectrum is more precision by using this method, and the decimation factor can be set by user between 2~20000 (1-2-5 step) in the application of a certain wireless communication analyzer.
Assuring K-coverage in the presence of mobility and wear-out failures in wireless sensor networks
Authors: Jayakrishnan V. Iyer, Heeyeol Yu, Hogil Kim, Eun Jung Kim, Ki Hwan Yum, Pyeong-Soo Mah
Venue: International Journal of Sensor Networks (2009)

Along with energy conservation, it has been a critical issue to maintain a desired degree of coverage in Wireless Sensor Networks (WSNs). In this paper, we consider more realistic WSN environments where the sensor nodes are moving around, which can disappear due to wear-out failures. By enhancing a variant of random waypoint model (Li et al., 2005), we propose Mobility Resilient Coverage Control (MRCC) to assure K-coverage in the presence of mobility. Our basic goals are (1) to elaborate the probability of breaking K-coverage with moving-in and moving-out probabilities and (2) to issue wake-up calls to sleeping sensors to meet user requirement of K-coverage even in the presence of mobility. Furthermore, to show the impact of wear-out failures on the coverage achieved, we adopt a lognormal distribution to depict the conditional probability of failures and observe the influence of reduced number of active nodes on coverage. Our experiments with Network Survivability &ndash; Double Link Failure show that MRCC achieves better coverage by 1.4% with 22% fewer active sensors than that of the existing Coverage Configuration Protocol (CCP). By taking reliability of nodes into account, the performance drop with respect to coverage is 3.7% (for coverage >1) while the reduction in the number of sensor nodes is 18.19% when compared with pure MRCC. Comparing CCP and MRCC with reliability, we observe a 3.4% reduction in coverage for the average probabilistic case and 5.78% for the individual probabilistic case, while achieving a 12.82% and 28.2% reduction in number of nodes, respectively.
A Comment to the Intelligent Functions of Different Weight Ciphers
Authors: Lan Luo, ZhGuang Qin, ShiJie Zhou
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

For different kinds of scale networks, the different weight ciphers should be designed for adapting various operation environments. In wireless networks or RFID environment, the lightweight ciphers or ultra-lightweight ciphers have been paid more and more attention. At Internet environment, there exist some block cipher algorithms used in top layer but not published block ciphers announce to only design for the other layers. The standardized security protocols of block cipher are oriented to the public level which is seldom considered based on different secure situation in openness Internet environment. And in trusted platform, some modules still need heavy ciphers. So this paper’s approach is that it needs precise cryptographic system according to different networks and different functions. The scalable and flexible block cipher application is another approach to currently secure standard and the lightweight block cipher design should be paid more attention. In order to expending networks member number easily, some intelligent functions are combined in the design.
Have a say over what you see: evaluating interactive compression techniques
Authors: Simon Tucker, Steve Whittaker
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

We all encounter many documents on a daily basis that we do not have time to process in their entirety. Nevertheless, we lack good tools to rapidly skim and identify key information from within such documents. This paper develops and evaluates Interactive Compression (IC) techniques that allow users to dynamically configure the amount of information they view in a document, e.g. by automatically removing unimportant information from view (Excision) or by making important information more salient (Highlighting). We explore IC techniques in the context of meeting transcripts that are typically unstructured - making it difficult to isolate relevant regions and extract key information. We demonstrate the superiority of IC compared with an unmodified text control. In contrast to traditional summaries, our results show extensive use of interactive, as opposed to fixed compression level, summarization. They also show the value of word- as opposed to utterance-based compression. There are also trade-offs between different IC designs. Excision allows users to scan documents faster than Highlighting but at the expense of overlooking relevant sections of the document.
Dynamic Analysis for Bracket of FOG
Authors: Gang Wang, Feng Sun
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Fiber Optical Gyroscope (FOG) is becoming affordable for many applications such as vehicle navigation and stabilization. Operating under the circumstance of which, vibration can’t be ignored. This paper researched into the characteristic of vibration of structure of FOG. Base on the model analysis using ANSYS (finite element analysis software), we did dynamic analysis for bracket of FOG. On the model analysis, we got the frequencies and model shapes of bracket. On the harmonic response analysis, we got the curves of frequency response. We analyse the frequencies and model shapes of bracket. At last, we brought forward the methods to optimize the framework design of FOG.
Fault modeling and testing of retention flip-flops in low power designs
Authors: Bing-Chuan Bai, Augusli Kifli, Chien-Mo Li, Kun-Cheng Wu
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Low power circuits have become a necessary part in modern designs. Retention flip-flop is one of the most important components in low power designs. Conventional test methodologies are not sufficient to test the retention flip-flop thoroughly. This paper presents four new fault models and the testing of retention flip-flop. The four fault models are awake-mode stuck-at fault, sleep-mode stuck-at fault, awake-mode transition fault, and sleep-mode transition fault. The four faults model the defects that affect the retained value, wakeup time, and sleep time of retention flip-flops. Based on the new fault models, test patterns for retention flip-flop can be easily generated by current automatic test pattern generation tools. The proposed test methodology is validated by performing experiments on ISCAS'89 benchmark circuits and some realistic industrial low power designs. The experimental results show that the faults of retention flip-flops can be easily detected by our method and the average fault coverage is higher than 98%. The fault coverage of conventional single stuck-at fault and transition fault test can be increased by more than 1%.
Distance education in support of lifelong learning: the case of the hellas alive web platform in building Greek language learning communities
Authors: Daphne Halkias, Geofrey T. Mills
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Lifelong learning, career development and recharging human capital outside of a formal college based institution will increasingly be done via electronic means, at a distance, and on demand. Desire, motivation are all necessary components of both education and lifelong learning, and harder to instill at a distance. How these elements can be fostered depends in large measure on how well teaching/learning communities can be established over the internet. The linchpin, therefore, is the ability to develop ways and means to establish a sense of community, and to create an emotional bond, amongst lifelong learner. The Hellenic American Union (Greece), in collaboration with the Academy of Electronic Media at Rensselaer Polytechnic Institute (USA) has developed a state-of-the-art, web-based language learning community unlike anything previously available to students or would-be students of the Greek language. With its flexibility and emphasis on real-world outcomes and adaptability, Hellas Alive learning platform represents an innovative step in language learning via the internet. This innovative learning community is an example of where distance education has merged with web technology in support of lifelong learning skills, in this case of second language acquisition.
User experience over time: an initial framework
Authors: Evangelos Karapanos, John Zimmerman, Jodi Forlizzi, Jean-Bernard Martens
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

A recent trend in Human-Computer Interaction (HCI) research addresses human needs that go beyond the instrumental, resulting in an increasing body of knowledge about how users form overall evaluative judgments on the quality of interactive products. An aspect largely neglected so far is that of temporality, i.e. how the quality of users' experience develops over time. This paper presents an in-depth, five-week ethnographic study that followed 6 individuals during an actual purchase of the Apple iPhone". We found prolonged use to be motivated by different qualities than the ones that provided positive initial experiences. Overall, while early experiences seemed to relate mostly to hedonic aspects of product use, prolonged experiences became increasingly more tied to aspects reflecting how the product becomes meaningful in one's life. Based on the findings, we promote three directions for CHI practice: designing for meaningful mediation, designing for daily rituals, and designing for the self.
Collaborative filtering using orthogonal nonnegative matrix tri-factorization
Authors: Gang Chen, Fei Wang, Changshui Zhang
Venue: Information Processing and Management: an International Journal (2009)

Collaborative filtering aims at predicting a test user's ratings for new items by integrating other like-minded users' rating information. The key assumption is that users sharing the same ratings on past items tend to agree on new items. Traditional collaborative filtering methods can mainly be divided into two classes: memory-based and model-based. The memory-based approaches generally suffer from two fundamental problems: sparsity and scalability, and the model-based approaches usually cost too much on establishing a model and have many parameters to be tuned. In this paper, we propose a novel framework for collaborative filtering by applying orthogonal nonnegative matrix tri-factorization (ONMTF), which (1) alleviates the sparsity problem via matrix factorization; (2) solves the scalability problem by simultaneously clustering rows and columns of the user-item matrix. Experiments on the benchmark data set show that our algorithm is indeed more tolerant against both sparsity and scalability, and achieves good performance in the mean time.
Improving protein secondary structure predictions by prediction fusion
Authors: Luigi Palopoli, Simona E. Rombo, Giorgio Terracina, Giuseppe Tradigo, Pierangelo Veltri
Venue: Information Fusion (2009)

Protein secondary structure prediction is still a challenging problem at today. Even if a number of prediction methods have been presented in the literature, the various prediction tools that are available on-line produce results whose quality is not always fully satisfactory. Therefore, a user has to know which predictor to use for a given protein to be analyzed. In this paper, we propose a server implementing a method to improve the accuracy in protein secondary structure prediction. The method is based on integrating the prediction results computed by some available on-line prediction tools to obtain a combined prediction of higher quality. Given an input protein p whose secondary structure has to be predicted, and a group of proteins F, whose secondary structures are known, the server currently works according to a two phase approach: (i) it selects a set of predictors good at predicting the secondary structure of proteins in F (and, therefore, supposedly, that of p as well), and (ii) it integrates the prediction results delivered for p by the selected team of prediction tools. Therefore, by exploiting our system, the user is relieved of the burden of selecting the most appropriate predictor for the given input protein being, at the same time, assumed that a prediction result at least as good as the best available one will be delivered. The correctness of the resulting prediction is measured referring to EVA accuracy parameters used in several editions of CASP.
Development and Research of HVDC Light System Based on DSP
Authors: Yanping Gao, Xianqiang Lv, Xianjiu Guo
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

After entering the 1990s, a new metal oxide semiconductor device-- insulated gate bipolar transistor (IGBT) was first widely used in the industrial driving device. The voltage source converter using IGBT has the ability to turn off current and it can also carry out passive inversion by using pulse width modulation (PWM) technology, which solves the problem of DC transmission to load points without AC supply. Because of strong function and small volume of this converter, it can reduce filtering devices in converter stations, omit converter transformers and simplify the structure of converter station, it is called HVDC light. This paper emphasizes the control technology of HVDC Light system based on VSC core research and designs the experimental system of HVDC Light, including overall design, parameter configuration of main circuit and software and hardware implementation schemes, etc; among these, converter is simulated by IGBT intelligent power module (IPM) and the control algorithm of the system is realized by DSP TMS320F2812A.
Management in data processing
Authors: John C. Biddle
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

This group of sessions is directed toward management in data processing and consists of three presentation discussion sessions and two panel sessions. The sessions have been selected for their appropriateness to today's problems in data processing management. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Stability for a class of difference equations
Authors: Yoshiaki Muroya, Emiko Ishiwata
Venue: Journal of Computational and Applied Mathematics (2009)

We consider the following non-autonomous and nonlinear difference equations with unbounded delays: {x"i"+"1=qx"i-@?j=-~ia"i","jf"i"-"j(x"j),i=0,1,2,...,x"j=@f"j,-~
A review of scheduling theory and methods for semiconductor manufacturing cluster tools
Authors: Tae-Eog Lee
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Cluster tools, which combine several single-wafer processing modules with wafer handling robots in a closed environment, have been increasingly used for most wafer fabrication processes. We review tool architectures, operational issues, and scheduling requirements. We then explain recent progress in tool science and engineering for scheduling and control of cluster tools.
Data types and abstraction
Authors: Hunyadi Ioan Daniel, Popa M. Emil, Musan Mircea
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In designing object-oriented programs, one of the primary concerns of the programmer is to develop an appropriate collection of abstractions for the application at hand, and then to define suitable abstract data types to represent those abstractions. In so doing, the programmer must be conscious of the fact that defining an abstract data type requires the specification of both a set of values and a set of operations on those values. In this paper I defined a C++ class hierarchy which is used to represent the basic repertoire of abstract data types.
The improved sweep metaheuristic for simulation optimization and application to job shop scheduling
Authors: George Jiri Mejtsky
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limited number of partial solutions in parallel and to search for solutions by searching the partial solutions. Traditionally, simulation optimization is carried out by multiple simulation runs executed sequentially. In contrast, the sweep algorithm executes multiple simulation runs simultaneously. It uses branching and pruning simulation models to carry out optimization. We describe new components of the algorithm, such as backtracking and local search. Then, we compare our approach with 13 metaheuristics in solving job shop scheduling benchmarks. Our approach ranks in the middle of the comparison which we regard as a success. The general nature of tree search offers a large array of sequential decision applications for the sweep algorithm, such as resource-constrained project scheduling, traveling salesman, or (real-time) production scheduling.
Plenary lecture I: fuzzy control of electrical drives
Authors: Constantin Volosencu
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

The paper presents a short survey of some topics related to speed control of electrical drives based on fuzzy PI controllers. In the beginning the conventional control systems of the main three motors mostly used in practice: DC motors, induction motors and permanent magnet synchronous motors are taken in discussion, emphasizing the way of their PI liner controller design. The paper presents how the fuzzy PI speed controllers may be developed for all three motors. A stability analysis of the fuzzy control of DC control system, based on circle criterion is presented. Modeling and simulation Simulink diagrams with transient characteristics for different functioning regimes are presented. A comparison of the quality criteria for fuzzy control systems and linear control systems is discussed. Some ways of implementation of the fuzzy speed controllers based on interpolation and neural networks is presented.
Short containers in Cayley graphs
Authors: Shuhong Gao, D. Frank Hsu
Venue: Discrete Applied Mathematics (2009)

The star diameter of a graph measures the minimum distance from any source node to several other target nodes in the graph. For a class of Cayley graphs from abelian groups, a good upper bound for their star diameters is given in terms of the usual diameters and the orders of elements in the generating subsets. This bound is tight for several classes of graphs including hypercubes and directed n-dimensional tori. The technique used is the so-called disjoint ordering for a system of subsets, due to Gao, Novick and Qiu [S. Gao, B. Novick, K. Qiu, From Hall's matching theorem to optimal routing on hypercubes, J. Comb. Theory B 74 (1998) 291-301].
On socially-inspired cooperative and efficient overlay network evolution based on group selection pattern
Authors: Yufeng Wang, Akihiro Nakao
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

In overlay networks, interplay between network structure and dynamics remains largely unexplored. In this paper, we study dynamic co-evolution between individual strategies (cooperative or defect) and overlay network structures. Inspired by evolutionary game theory, we propose a general scheme to evolve a given overlay into the resulting topology, which has high global network efficiency and average clustering coefficient that indicate high small-world-ness. In our scheme, peers' local interactions integrate network reciprocity and group selection algorithm, and lead to the emergence of cooperative and efficient overlay network structure. Specifically, we design a link-formation game to characterize the social dilemma of forming links in overlay network, which means that, in this game, defection always gives individual peers a higher payoff regardless of what opponent's strategy is, but, the aggregation of payoffs by mutual cooperative peers is always better than all other cases. In its evolutionary link formation phase, we adopt simple economic process-each peer keeps one link to cooperative neighbor in its neighborhood. Our simulation results show that the proposed mechanism can drive a given overlay network into fully cooperative and efficient small-world structure.