ppxscal/embedding_network huggingface dataset:
Intelligent Single-layer Evaluation System By Using Lattice Linguistic Truth-value
Authors: Dan Meng, Zaiqiang Zhang, Xiaobing Li, Yang Xu
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

In this paper, an intelligent single-layer evaluation system by using Lattice linguistic truth-value is presented. It is aimed to deal with some uncertainty linguistic value information which is difficult or unappropriate to express in numerical value. In this approach, evaluator can give evaluation value for every criterion in natural language. And all evaluation value given by evaluator will be transformed to satisfaction and expressed by truth-value. In the final evaluation results, different important coefficient which comes from both evaluation criteria and evaluator will be considered.
IPC Considered Harmful for Multiprocessor Workloads
Authors: Alaa R. Alameldeen, David A. Wood
Venue: IEEE Micro (2006)

Many architectural simulation studies use instructions per cycle (IPC) to analyze performance. For multithreaded programs running on multiprocessor systems, however, IPC often inaccurately reflects performance and leads to incorrect or misleading conclusions. Work-related metrics, such as time per transaction, are the most accurate and reliable way to estimate multiprocessor workload performance.
VizRank: Data Visualization Guided by Machine Learning
Authors: Gregor Leban, Blaž Zupan Gaj Vidmar
Venue: Data Mining and Knowledge Discovery (2006)

Data visualization plays a crucial role in identifying interesting patterns in exploratory data analysis. Its use is, however, made difficult by the large number of possible data projections showing different attribute subsets that must be evaluated by the data analyst. In this paper, we introduce a method called VizRank, which is applied on classified data to automatically select the most useful data projections. VizRank can be used with any visualization method that maps attribute values to points in a two-dimensional visualization space. It assesses possible data projections and ranks them by their ability to visually discriminate between classes. The quality of class separation is estimated by computing the predictive accuracy of k-nearest neighbor classifier on the data set consisting of x and y positions of the projected data points and their class information. The paper introduces the method and presents experimental results which show that VizRank's ranking of projections highly agrees with subjective rankings by data analysts. The practical use of VizRank is also demonstrated by an application in the field of functional genomics.
UGetMobile End-user Mobile Publishing Platform
Authors: Tom Pfeifer, Helene Haughney, Barry Downes
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)

UGetMobile advances the state of the art in Web 2.0 services, by creating an Internet service that enables end-users to "get mobile" - use the Internet to create mobile accessible web-sites and mobile value added services such SMS (Short Message Service), MMS (Multimedia Message Services), blogs, LBS (Location Base Services), video and e-mail. UGetMobile enhances these services by creating deep interconnections with mobile Operator's mobile portals and Service Delivery Platforms (SDP) via OSA/Parlay; and UGetMobile will leverage the growth of key emerging Web 2.0 mobile services such as Google Local, Google Base, Google Mobile, MSN mobile and Yahoo mobile.
Introduction to modeling and simulation
Authors: John S. Carson,  II
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Simulation is a powerful tool for the analysis of new system designs, retrofits to existing systems and proposed changes to operating rules. Conducting a valid simulation is both an art and a science. This paper provides an introduction to simulation and modeling and the main concepts underlying simulation. It discusses a number of key issues regarding a simulation team, how to conduct a simulation study, the skills required and the steps involved. It also provides project management guidelines and outlines pitfalls to avoid.
MAPK Signaling Pathways and Their Recursive Modularization
Authors: Rajat K. De, Losiana Nayak
Venue: Proceedings of the 15th International Conference on Computing (2006)

Signal transduction pathways are very complex biochemical networks that include a large number of vital biomolecules and chemical compounds whose activities are dependent on member(s) involved in the network under consideration as well as other networks. Modularized study of such networks will be more appropriate for deciphering the underlying mechanisms that control physiological behavior of cell(s). Here we have proposed an algorithm for modularizing signal transduction network which is applied to MAPK pathway of D. melanogaster and H. sapiens. The idea "a member whose activity is controlled by maximum number of other members in the network under consideration, tends to be the center of a module" is used to divide a network into different modules. These modules are created by taking a certain level of complexity .. into account, i.e., in an expanding module, a member having more than .. relations that lie outside the module, are ignored. Recursive modularization can create modules at different stages of various complexities that finally lead to convergence of the entire network into a single module.
Specification Based Regression Testing Using Explicit State Space Enumeration
Authors: Sujit Kumar Chakrabarti, Y. N. Srikant
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

This paper presents a method of partial automation of specification based regression testing, which we call ESSE (Explicit State Space Enumeration). The first step in ESSE method is the extraction of a finite state model of the system making use of an already tested version of the system under test (SUT). Thereafter, the finite state model thus obtained is used to compute good test sequences that can be used to regression test subsequent versions of the system. We present two new algorithms for test sequence computation - both based on our finite state model generated by the above method. We also provide the details and results of the experimental evaluation of ESSE method. Comparison with a practically used random-testing algorithm has shown substantial improvements.
Towards a visual notation for pipelining in a visual programming language for programming FPGAs
Authors: C. T. Johnston, D. G. Bailey, P. Lyons
Venue: Proceedings of the 7th ACM SIGCHI New Zealand chapter's international conference on Computer-human interaction: design centered HCI (2006)

VERTIPH is a visual language designed to aid in the development of image processing algorithms on FPGAs (Field Programmable Gate Arrays). We justify the use of a visual language for this purpose, and describe the key parts of VERTIPH. One aspect of importance is how to clearly and efficiently represent a pipeline of processors, and in particular distinguish a pipeline from the simpler serial or parallel structures. This paper develops a number of pipeline representations, discussing the rationale behind and limitations associated with each representation. The culmination of this development is the Sequential Pipeline with Detailed Bars, visually an efficient and unambiguous representation.
Electrophysiological Evidence for Early Contextual Influences during Spoken-Word Recognition: N200 Versus N400 Effects
Authors: Daniëlle Van Den Brink, Colin M. Brown, Peter Hagoort
Venue: Journal of Cognitive Neuroscience (2001)

An event-related brain potential experiment was carried out to investigate the time course of contextual influences on spoken-word recognition. Subjects were presented with spoken sentences that ended with a word that was either (a) congruent, (b) semantically anomalous, but beginning with the same initial phonemes as the congruent completion, or (c) semantically anomalous beginning with phonemes that differed from the congruent completion. In addition to finding an N400 effect in the two semantically anomalous conditions, we obtained an early negative effect in the semantically anomalous condition where word onset differed from that of the congruent completions. It was concluded that the N200 effect is related to the lexical selection process, where word-form information resulting from an initial phonological analysis and content information derived from the context interact.
Efficient In-Network Moving Object Tracking in Wireless Sensor Networks
Authors: Chih-Yu Lin, Wen-Chih Peng, Yu-Chee Tseng
Venue: IEEE Transactions on Mobile Computing (2006)

The rapid progress of wireless communication and embedded microsensing MEMS technologies has made wireless sensor networks possible. In light of storage in sensors, a sensor network can be considered as a distributed database, in which one can conduct in-network data processing. An important issue of wireless sensor networks is object tracking, which typically involves two basic operations: update and query. This issue has been intensively studied in other areas, such as cellular networks. However, the in-network processing characteristic of sensor networks has posed new challenges to this issue. In this paper, we develop several tree structures for in-network object tracking which take the physical topology of the sensor network into consideration. The optimization process has two stages. The first stage tries to reduce the location update cost based on a deviation-avoidance principle and a highest-weight-first principle. The second stage further adjusts the tree obtained in the first stage to reduce the query cost. The way we model this problem allows us to analytically formulate the cost of object tracking given the update and query rates of objects. Extensive simulations are conducted, which show a significant improvement over existing solutions.
Analysis of the academic discourse community constructed in a computer-mediated asynchronous learning environment
Authors: Joanne Larson
Venue:  (2006)

This research is designed to develop an understanding of the nature of the academic discourse community constructed through and by a computer-mediated asynchronous learning environment. The study examines the environment developed through the online discourse created during an introductory undergraduate liberal arts course in Philosophy. The scientific research on effective learning environments identified by National Research Council is used to inform the methods of Critical Discourse Analysis to provide a close analysis of the context. The analysis is approached from the perspective of linguistic anthropology and examines the on-line learning environment as a linguistic space created through the online discourse which serves as both a resource for and a product of the social interaction of the students and instructor. In this case, the text was examined with respect to the instructor's and students' goals for the course, and in light of its ability to function as an effective learning environment. The analysis shows that the learning environment created through and by the online discourse is multidimensional and flexibly adaptive. A range of linguistic strategies provide support for constructing student identities and supporting meaning-making. The findings indicate significant learner control and flexibility afforded by the use of the online discourse which supports both dialogical and monological instruction within the same environment. The ways in which the students chose to use the elements of time and place independence to navigate the environment for their own purposes provides insights into the manner in which the Asynchronous Learning Network functions as a learning space, while also supporting the institutional curricular needs and the instructional goals of the faculty. The results presented here add to the research on distance learning and extend our understanding the nature of online discourse as both an intellectual dialogue through which students construct meaning and a space for individual reflections through which students come to understand content. The study suggests that perceptions about the function of the learning environment in an online course need to be adjusted to allow for variation in participation based on individual goals.
A concept geometry for conceptual spaces
Authors: John T. Rickard
Venue: Fuzzy Optimization and Decision Making (2006)

This paper generalizes and extends the theory of conceptual spaces as originally proposed by Gardenförs (Conceptual spaces. Cambridge, MA: MIT Press) to provide further geometric representations of both concepts and object observations within a multi-dimensional fuzzy space corresponding to a subset of a unit hypercube. With these representations, we are able directly to calculate normalized scalar measures both of the similarity of two different concepts and of the degree to which an observation satisfies a concept description, and thus to perform inferences with respect to situational assessments and predictions. This capability is directly relevant to the implementation of Levels 2 and 3 data fusion functions using our approach.
Adding Value with 3D Visualization and Haptic Forces to Radiosurgery--A Small Theory-Based, Quasi-Experimental Study
Authors: David Dinka, James M. Nyce, Toomas Timpka, Kristina Holmberg
Venue: Journal of Medical Systems (2006)

This study investigates the use of 3D representation and haptic technology in radiosurgery. The users, experienced users of the Leksell GammaKnife, prefer the 3D representation for constructing a first draft of their plan for neurosurgical intervention. When it comes to the final adjustments, however, they still choose the traditional 2D representation and interaction devices. The perceived control over the radiosurgical process is not considered adequate using the 3D interaction methods. Practitioners do not consider the haptic forces implemented in this test system useful. Possible explanations for these findings are discussed in the paper.
An Enhanced Method for the Snake Algorithm
Authors: Charles C. H. Lean, Alex K. B. See, S. Anandan Shanmugam
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

The snakes algorithm is an image segmentation process that utilises energy-minimising splines. The energy terms are obtained from discrete points that make up a snake and the gray-level values in an image. An algorithm for automated positioning of the initial snake points is presented by the authors, together with two additional energy terms (intensity and spring) for the snake functional. The introduction of these two terms was found to produce a better segmentation result, with fewer iterations required for the snake to complete its energy-minimising process.
Qualifying Use Case Diagram Associations
Authors: Adenekan (Nick) Dedeke, Benjamin Lieberman
Venue: Computer (2006)

Conceptual use case diagrams that draw on critical analysis can enhance a project manager's ability to allocate medium-sized or large-scale development projects in a way that limits task duplication and functional overlaps.
Why students drop out CS1 course?
Authors: Päivi Kinnunen, Lauri Malmi
Venue: Proceedings of the second international workshop on Computing education research (2006)

This study focuses on CS minor students' decisions to drop out from the CS1 course. The high level of drop out percentage has been a problem at Helsinki University of Technology for many years. This course has yearly enrolment of 500-600 students and the drop out percentage has varied from 30-50 percents.Since we did not have clear picture of drop out reasons we conducted a qualitative interview research in which 18 dropouts from the CS1 course were interviewed. The reasons of drop out were categorized and, in addition, each case was investigated individually. This procedure enabled us to both list the reasons and to reveal the cumulative nature of drop out reasons.The results indicate that several reasons affect students' decision to quit the CS1 course. The most frequent reasons were the lack of time and the lack of motivation. However, both of these reasons were in turn affected by factors, such as the perceived difficulty of the course, general difficulties with time managing and planning studies, or the decision to prefer something else. Furthermore, low comfort level and plagiarism played a role in drop out. In addition, drop out reasons cumulated.This study shows that the complexity and large variety of factors involved in students' decision to drop the course. This indicates that simple actions to improve teaching or organization on a CS1 course to reduce drop out may be ineffective. Efficient intervention to the problem apparently requires a combination of many different actions that take into consideration the versatile nature of reasons involved in drop out.
Dynamic Support for Distributed Certification Authority in Mobile Ad Hoc Networks
Authors: Sanjay Raghani, Durga Toshniwal, Ramesh Joshi
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Use of Public Key Cryptography and Certificates is one of the effective ways of securing a Mobile Ad Hoc Network (MANET). Certificates are issued by Certification Authority (CA). In order to use a CA in MANETs, researchers have proposed the design of a distributed CA based on Threshold Cryptography. In such schemes, the functionality of CA is distributed amongst nodes in the network. With a distributed CA, Certification Service is provided by a coalition of Threshold number of nodes. In the design of a distributed CA that we follow, a node obtains the certification service by communicating with its onehop neighbors. With such distributed CA, when the number of neighbors of a node, also called node degree, reduces, there is a substantial increase in the certification service delays. In this paper we propose a solution for the above problem using a suite of network monitoring protocols. The proposed protocol suite is based on the observation that when the node degree varies, the delays involved in obtaining certificates may be reduced by dynamically varying the Threshold value. The proposed protocols dynamically adjust the Threshold value by monitoring the Average Node Degree of the network and thereby prevent an increase in certification service delay.
Receiver-oriented multiple access in ad hoc networks with directional antennas
Authors: Lichun Bao, J. J. Garcia-Luna-Aceves
Venue: Wireless Networks (2005)

Directional antennas can adaptively select radio signals of interest in specific directions, while filtering out unwanted interference from other directions. A couple of medium access protocols based on random access schemes have been proposed for networks with directional antennas, using the omnidirectional mode for the transmission or reception of control packets in order to establish directional links. We propose a distributed receiver-oriented multiple access (ROMA) scheduling protocol, capable of utilizing multi-beam forming directional antennas in ad hoc networks. Unlike random access schemes that use on-demand handshakes or signal scanning to resolve communication targets, ROMA computes a link activation schedule in each time slot using two-hop topology information. It is shown that significant improvements on network throughput and delay can be achieved by exploiting the multi-beam forming capability of directional antennas in both transmission and reception. The performance of ROMA is studied by simulation, and compared with a well-know static scheduling scheme that is based on global topology information.
New lower bounds to the variance of signal parameter estimators using Bayesian inference
Authors: A. Quinn
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

The Cramer-Rao lower bound (CRLB) characterizes the variance of joint estimators, including the maximum likelihood (ML) estimator, but it is not tenable for Bayesian marginal estimation. The theory of the CRLB is extended, therefore, within the Bayesian framework, to yield lower bounds to Bayesian marginal estimator variance for the first time. The theory confers a formal procedure for reducing the parameterization of the CRLB. The current procedure for achieving this is to average the CRLB, but it is shown that the new marginal formalism yields greater lower bounds. The marginal bounds are derived for a general signal class, and evaluated for the marginal estimator of difference frequency between two closely spaced tones. 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
A Collaborative Filtering Algorithm Employing Genetic Clustering to Ameliorate the Scalability Issue
Authors: Feng Zhang, Hui-you Chang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Collaborative filtering technologies are facing two major challenges: scalability and recommendation quality, which are two goals in conflict. Nowadays more studies are focusing on the quality issue but less on the scalability one. We introduce a genetic clustering algorithm to partition the source data, guaranteeing that the intra-similarity will be high but the inter-similarity will be low. The clustering process is off-line running. Our empirical results show that the genetic clustering based collaborative filtering recommender system outperforms the memory-based one in scalability, and outperforms the k-means clustering based one and the memory-based one in recommendation quality.
Unsteady analytical solutions of the spherical shallow water equations
Authors: Matthias Läuter, Dörthe Handorf, Klaus Dethloff
Venue: Journal of Computational Physics (2005)

A new class of unsteady analytical solutions of the spherical shallow water equations (SSWE) is presented. Analytical solutions of the SSWE are fundamental for the validation of barotropic atmospheric models. To date, only steady-state analytical solutions are known from the literature. The unsteady analytical solutions of the SSWE are derived by applying the transformation method to the transition from a fixed cartesian to a rotating coordinate system. Fundamental examples of the new unsteady analytical solutions are presented for specific wind profiles. With the presented unsteady analytical solutions one can provide a measure of the numerical convergence in the case of a temporally evolving system. An application to the atmospheric model PLASMA shows the benefit of unsteady analytical solutions for the quantification of convergence properties.