ppxscal/embedding_network huggingface dataset:
Collaborative support among distance teaching assistants with a dialog pattern-based bulletin board tool
Authors: Ryo Takaoka, Kohei Kusano, Toshio Okamoto
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

The final aim of this study is to develop collaborative support protocols among pedagogical agents to support collaborative group learning. As the first step of this research, we have designed a learning support model that includes a teacher who gives a lesson in a school and distance teaching assistants (Distance TAs) who asynchronously support group learners, who are engaged in problem-solving activities in a learning support environment. In this environment, there are three tools: a Web work tool to record and save group or individual work, a dialog pattern-based Web bulletin board tool to support remote group learning, and a meeting bulletin board tool to allow the Distance TAs to discuss support strategies and tactics. In this support environment, we performed a practice lesson, in which high school students designed a sightseeing plan in a group. Thirty-nine high school students as learners and 27 university students as Distance TAs participated in this practice. From its results, we extracted some cases of collaborative support involving Distance TAs in the learning and support process. These extracted examples can be used as collaborative protocols for pedagogical agents in supporting collaborative group learning.
Synchronization at Low SINR in Asynchronous Direct-Sequence Spread-Spectrum Communications
Authors: Jaewook Shim, Manish Amde, Kenneth Yun, Rene Cruz
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Currently deployed asynchronous wireless networks, e.g., 802.11a/b/g, have a limited spatial range and low reliability due to their inability to operate at low signal to interference and noise ratio (SINR). Low SINR operation can be achieved using a direct-sequence spread-spectrum (DSSS) based communication with a high spreading gain. The reception at low SINR is limited by the inability to synchronize at a low SINR. In this paper, we present the design of a synchronization block which enables a receiver to synchronize to an incoming packet at a low SINR with a high reliability. It leverages an algorithm for code acquisition in asynchronous packet-based reception described in [1]. The design of this block also consists of novel algorithms for code tracking, frame synchronization and multipath search for RAKE combining. A payload based on binary orthogonal signaling is attached to the packet header to complete an asynchronous packet-based system. The simulation results show that each of the synchronization algorithms as well as the entire synchronization block operate reliably at low SINR at the input of the receiver.
On the existence of higher order polynomial lattices based on a generalized figure of merit
Authors: Josef Dick, Peter Kritzer, Friedrich Pillichshammer, Wolfgang Ch. Schmid
Venue: Journal of Complexity (2007)

Dick and Pillichshammer recently introduced generalized rank-1 polynomial lattices which can be viewed as digital (t,@a,@b,nxm,s)-nets as introduced by the first author. In this work we generalize the figure of merit of rank-1 polynomial lattices such that the new figure of merit @r"@a is related to the t-value, when one views the rank-1 polynomial lattice as a digital (t,@a,@b,nxm,s)-net. Then we show the existence of rank-1 polynomial lattices for which the generalized figure of merit @r"@a satisfies a certain condition. We present some numerical results comparing the corresponding t-value to known explicit constructions.
The unified theory of pseudorandomness: guest column
Authors: S. Vadhan
Venue: ACM SIGACT News (2007)

We survey the close connections between a variety of "pseudorandom objects," namely pseudorandom generators, expander graphs, list-decodable error-correcting codes, randomness extractors, averaging samplers, and hardness amplifiers.
A comparative study of exponential distribution vs Weibull distribution in machine reliability analysis in a CMS design
Authors: K. Das
Venue: Computers and Industrial Engineering (2008)

The paper addresses machine reliability consideration by Weibull and exponential distribution approach in designing a cellular manufacturing system (CMS). A multi-objective mixed integer programming (MIP) model that considers machine system reliability and system cost simultaneously is presented to implement the approach. When a part has the option to be processed in alternative routes, the route with the highest system reliability can be selected by considering individual machine reliabilities along each route. A CMS design approach which selects processing routes for the part types with maximum system reliability, considering the machines along routes while optimizing system cost, will improve the overall performance of the system. The rerouting provision of the part types, integrated with the approach, will also help the user/designer to solve machine breakdown problems during processing of a part. This study offers the capability to model different failure characteristics, such as, an increasing, decreasing or constant machine failure rate. An example problem is solved to illustrate applicability of the model.
On the impact of serialization on the cache performances in Network-on-Chip based MPSoCs
Authors: Paolo Meloni, Giovanni Busonera, Salvatore Carta, Luigi Raffo
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Network on Chip architectures are proposed as a so- lution to overcome functional and physical scalability shown by shared bus based MPSoC architecture. Unfor- tunately to implement and efficient communication in- frastructure, the designer has to set a lot of parameters. An exhaustive knowledge of how the chosen settings in- fluence the overall behaviour of the designed system is then mandatory. Aim of this paper is to discuss the re- lationship between the performances of a NoC and its configuration parameters in the case of traffic gener- ated by cache operations (block replacements). We paid special attention to investigate the impact of the serial- ization factor, that was already not clearly assessed in literature for this important case study. A numerical analysis, referring to an actual implementation of the NoC on a state-of-the-art 65nm technological process was performed. The obtained results were used to re- port an energy and execution time exploration over the complete design space of interest.
Applying Particle Swarm Intelligence for Feature Selection of Spectral Imagery
Authors: Sildomar Takashi Monteiro, Yukio Kosugi
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Feature selection is necessary to reduce the dimensional- ity of spectral image data. Particle swarm optimization was originally developed to search only continuous spaces and, although many applications on discrete spaces had been proposed, it could not tackle the problem of feature selec- tion directly. We developed a formulation utilizing two par- ticles swarms in order to optimize a desired performance criterion and the number of selected features, simultane- ously. Candidate feature sets were evaluated on a regres- sion problem modeled using neural networks, which were trained to construct models of chemical concentration of glucose in soybeans. We present experimental results uti- lizing real-world spectral image data to attest the viability of the method. The particle swarms approach presented su- perior performance for linear modeling of chemical con- tents when compared to a conventional feature extraction method.
PushFS: A Smart Push File Service Model for Ubiquitous Storage
Authors: Meijun Tao, Jianhua Yang, Zhaohui Wu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The traditional file service is no longer sufficient for providing reliable and smart service to users as roaming in ubiquitous computing environments. In this paper, we propose a smart push file service model, called PushFS, which employs a push-oriented file service for ubiquitous storage. The design of PushFS introduces user-profiles to identify the environmental-context and file-semantics for retrieve, and hoards virtual directories and virtual files into lightweight working sets on-demand. We indicate that the dynamic metadata-aware file selection and organization capability increases efficiency of the file service and improves the tradeoff between proactivity and transparency. We then implement a prototype system to validate our model, which shows that PushFS is adequate to ubiquitous storage with high efficient and proactive file service.
Factors Affecting End Users' Intrinsic Motivation to Use Software
Authors: Thippaya Chintakovid
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Several research efforts have developed new tools to help end users create effective software. End users will gain benefits from these new tools if they actually adopt and use the systems' features. Most users are likely to be driven by job productivity; thus, they tend to use known features to complete a task rather than taking time to learn to use new features which could more effectively handle the task [3]. This research proposes to investigate what motivates end users to use new features. Particularly, it focuses on end users' intrinsic motivation. Intrinsic motivation is an internal drive to perform an activity for the sake of enjoyment of the activity itself [5]. Users with intrinsic motivation enjoy exploring and using the new features. Evidence shows that intrinsic motivation can impact users' software adoption better than extrinsic motivation. For example, game-based software training, which was more interesting and enjoyable, enhanced users' perceived ease of use and intention to use the software more than traditional lecture-based training [10]. Workplace applications can also be intrinsically motivating. Users who used a menu-based word processing application had greater intrinsic motivation than those using a command-based application [8].
Modeling motivation for adaptive nonplayer characters in dynamic computer game worlds
Authors: Kathryn Merrick
Venue: Computers in Entertainment (CIE) (2008)

Current computer games are being set in increasingly more complex and dynamic virtual environments. Massively multiplayer online games, for example, are played in persistent virtual worlds, which evolve and change as players create and personalize their own virtual property. In contrast, technologies for controlling the behavior of nonplayer characters that populate virtual game worlds are frequently limited to preprogrammed rules. Characters using fixed rule-sets lack the ability to adapt in time with their environment. Motivated reinforcement learning offers an alternative to character design that can achieve nonplayer characters that both evolve and adapt in dynamic environments. This article presents and evaluates two computational models of motivation for use in nonplayer characters in persistent computer game worlds. These models represent motivation as an ongoing search for novelty, interest, and competence. Two metrics are introduced to evaluate the adaptability of characters controlled by motivated reinforcement learning agents using different models of motivation. These metrics characterize the behavior of nonplayer characters in terms of the variety and complexity of learned behaviors. An empirical evaluation of characters in simulated game scenarios shows that characters motivated by the search for competence are more adaptable in dynamic environments than those motivated by interest and novelty alone.
Moving Toward a Standard Military Computer Family
Authors: H. S. Stone
Venue: Computer (1979)

The three papers that follow this introduction describe a number of technical issues that have arisen out of studies sponsored by the three services. The end goal of the studies is to determine how best, if at all, the military should standardize its computer systems.
Chromatism Classification System Based on Hybrid Intelligent
Authors: Weiqing Li, Qun Wang, Chengbiao Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

An online tile Chromatism classification system based on hybrid intelligent was presented. It combined artificial neural network with fuzzy technique and genetic algorithm technique to implement chromatism classification of tile image and added spatial distribution information of color to the old method to improve the precision. Artificial neural network was applied to solve the problem that there is no certain rule because the type of tile is various and the result needs accord to the ones of human vision. Fuzzy technique was applied in the input and output of artificial neural network to increase the precision. Genetic algorithm was introdued to optimize the linking weigh values between the layers, which improved the training speed of the network. The result showed that this method performed better in speed and precise than traditional method or only using neural network techniques.
Capturing global transactions from multiple recovery log files in a partitioned database system
Authors: Chengfei Liu, Bruce G. Lindsay, Serge Bourbonnais, Elizabeth B. Hamel, Tuong C. Truong, Jens Stankiewitz
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

DB2 DataPropagator is one of the IBM's solutions for asynchronous replication of relational data by two separate programs Capture and Apply. The Capture program captures changes made to source data from recovery log files into staging tables, while the Apply program applies the changes from the staging tables to target data. Currently the Capture program only supports capturing changes made by local transactions in a single database log file. With the increasing deployment of partitioned database systems in OLTP environments there is a need to replicate the operational data from the partitioned systems. This paper introduces a system called CaptureEEE which extends the Capture program to capture global transactions executed on partitioned databases supported by DB2 Enterprise-Extended Edition. The architecture and the components of CaptureEEE are presented. The algorithm for merging log entries from multiple recovery log files is discussed in detail.
On Transversal Hypergraph Enumeration in Mining Sequential Patterns
Authors: Dong (Haoyuan) Li, Anne Laurent, Maguelonne Teisseire
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

The transversal hypergraph enumeration based algorithms can be efficient in mining frequent itemsets, however it is difficult to apply them to sequence mining problems. In this paper we first analyze the constraints of using transversal hypergraph enumeration in itemset mining, then propose the ordered pattern model for representing and mining sequences with respect to these constraints. We show that the problem of mining sequential patterns can be transformed to the problem of mining frequent ordered patterns, and therefore we propose an application of the Dualize and Advance algorithm, which is transversal hypergraph enumeration based, in mining sequential patterns.
OPJK and DILIGENT: ontology modeling in a distributed environment
Authors: Pompeu Casanovas, Nria Casellas, Christoph Tempich, Denny Vrandecić, Richard Benjamins
Venue: Artificial Intelligence and Law (2007)

In the legal domain, ontologies enjoy quite some reputation as a way to model normative knowledge about laws and jurisprudence. This paper describes the methodology followed when developing the ontology used by the second version of the prototype Iuriservice, a web-based intelligent FAQ for judicial use. This modeling methodology has had two important requirements: on the one hand, the ontology needed to be extracted from a repository of professional judicial knowledge (containing nearly 800 questions regarding daily practice). Thus, the construction of ontologies of professional judicial knowledge demanded the description of this knowledge as it is perceived by the judge. On the other hand, due to the distributiveness of the environment, there was a need for controlled discussion and traceability of the arguments used in favor or against the introduction of a concept X as part of the domain ontology. This paper presents the Ontology of Professional Judicial Knowledge (OPJK), extracted manually from the selection of relevant terms from judicial practice questions and modeled according to the DILIGENT methodology. We will show that DILIGENT has proved to be a methodology that facilitates the ontology engineering in a distributed environment, although appropriate tool support needs to be developed.
A Restoration and Extrapolation Iterative Method for Band-limited Fluorescence Microscopy Image
Authors: Moacir P. Ponti-Junior, Nelson D. A. Mascarenhas, Claudio A. T. Suazo
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

Optical microscopic images, especially with a nonconfocal microscope, are fundamentally limited because the optical transfer function (the Fourier transform of the point-spread function) is zero over a region of the spatial-frequency domain. Iterative algorithms were developed for the restoration and extrapolation of diffraction-limited imagery. In this paper we present the effectiveness of an iterative method based on the Richardson-Lucy algorithm for image restoration and a simultaneous modified version of Gerchberg-Papoulis method to extrapolate the spectrum and control the noise amplification. Good convergence stabilization results were achieved and also good numerical results were observed.
Fault Secure Encoder and Decoder for Memory Applications
Authors: Helia Naeimi, Andre DeHon
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

We introduce a reliable memory system that can tolerate multiple transient errors in the memory words as well as transient errors in the encoder and decoder (corrector) circuitry. The key novel development is the fault-secure detector (FSD) error-correcting code (ECC) definition and associated circuitry that can detect errors in the received encoded vector despite experiencing multiple transient faults in its circuitry. The structure of the detector is general enough that it can be used for any ECC that follows our FSD-ECC definition. We prove that two known classes of Low-Density Parity-Check Codes have the FSD-ECC property: Euclidean Geometry and Projective Geometry codes. We identify a specific FSD-LDPC code that can tolerate up to 33 errors in each memory word or supporting logic that requires only 30% area overhead for memory blocks of 10 Kbits or larger. Larger codes can achieve even higher reliability and lower area overhead. We quantify the importance of protecting encoder and decoder (corrector) circuitry and illustrate a scenario where the system failure rate (FIT) is dominated by the failure rate of the encoder and decoder.
Using Ranked Nodes to Model Qualitative Judgments in Bayesian Networks
Authors: Norman E. Fenton, Martin Neil, Jose Galan Caballero
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Although Bayesian Nets (BNs) are increasingly being used to solve real world risk problems, their use is still constrained by the difficulty of constructing the node probability tables (NPTs). A key challenge is to construct relevant NPTs using the minimal amount of expert elicitation, recognising that it is rarely cost-effective to elicit complete sets of probability values. We describe a simple approach to defining NPTs for a large class of commonly occurring nodes (called ranked nodes). The approach is based on the doubly truncated Normal distribution with a central tendency that is invariably a type of weighted function of the parent nodes. In extensive real-world case studies we have found that this approach is sufficient for generating the NPTs of a very large class of nodes. We describe one such case study for validation purposes. The approach has been fully automated in a commercial tool, called AgenaRisk, and is thus accessible to all types of domain experts. We believe this work represents a useful contribution to BN research and technology since its application makes the difference between being able to build realistic BN models and not.
A Convex Combination Approach for the Weights of Interval Fuzzy Preference Relation
Authors: Ji-bin Lan, Fang Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

The weights of interval fuzzy preference relation gen- erated in the analytic hierarchy process are investigated. Making use of a convex combination method, a family of real fuzzy preference relations are constructed. The aggre- gation of the weights of the family of real fuzzy preference relations is considered as the weights of interval fuzzy pref- erence relation. In order to make any weight vector of the family of real fuzzy preference relations reliable, the suf- ficient and necessary conditions of their consistency and weak transitivity are given. When they are inconsistent, the method of repairing them to reach weak transitivity is also proposed. A numerical example is given to illustrate the validity and practicality of the developed methods.
Mulini: an automated staging framework for QoS of distributed multi-tier applications
Authors: Gueyoung Jung, Calton Pu, Galen Swint
Venue: Proceedings of the 2007 workshop on Automating service quality: Held at the International Conference on Automated Software Engineering (ASE) (2007)

The increasing scale and success of distributed multi-tier applications have created increasingly dynamic workload variations that made system performance less predictable. Consequently, staging has become a significant and useful method to characterize the performance and Quality of Service (QoS) of such applications. Manual staging is an expensive, time consuming and error-prone process. In particular, manually exploring a large configuration parameter space of the applications is a cumbersome task. In this article, we outline the design of Mulini, an automated staging framework for large-scale multi-tier applications that realizes the automation via an extensible and flexible code generator. Mulini adopts XSLT/XPath tools and aspect-oriented programming (AOP) techniques to manipulate XML-encoded high-level specifications and weave non-functional specifications (e.g., QoS) into staging implementation. To illustrate the usability of the Mulini code generator in complex staging, we apply Mulini to bottleneck detection and observation-based performance characterization of the RUBiS e-Commerce benchmark.
A Progression of Human Figures Simulated by Computer Graphics
Authors: W. A. Fetter
Venue: IEEE Computer Graphics and Applications (1982)

Spanning two decades, these studies have led to the development of simulated human figures that are both anthropometrically accurate and useful in a variety of applications. 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