ppxscal/embedding_network huggingface dataset:
The quest for an administrative nexus for information technology programs
Authors: George S. Nezlek, Paul M. Leidig
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

Information Technology and Information Systems have evolved as inherently interdisciplinary fields. While an essentially haphazard proliferation of programs has helped to create a field of study that can necessarily and appropriately cross boundaries between mathematics, science, engineering, and business disciplines, the historical ambiguity with respect to program naming and classification has been, for many individuals and institutions, a source of confusion. As a discipline, if indeed there can be a single discipline to consider, individuals, educational institutions, and practitioners are constantly addressing the issue of where programs belong, both pedagogically and administratively. The existence of numerous, competing classification schemes, none of which appears to either offer a compelling advantage or commands a consensus concerning appropriateness, is the core issue the authors address in this paper. An analysis of data that are freely available (web sites for relevant academic institutions and programs) reveals literally hundreds of titles and dozens of administrative configurations for programs that fall under the broader and typical headings of CS, IS, IT, MIS, etc.. A similar inquiry into the practitioner side of the problem reveals numerous competing schemes that include, CIP & SOC, not to mention a myriad of taxonomies from various industry and professional groups (ACM, IEEE, etc.). The one thing that can be asserted with essentially absolute confidence is that this amalgam is confusing at best, and the status quo is not in the long-term interests of the discipline. The authors make no grandiose claims to having developed a unified paradigm to magically make sense of the wide range of program offerings in the numerous Information Technology and Information Systems related disciplines. Rather, this paper recognizes and begins to address the need to lay a foundation for appropriately categorizing and classifying this diverse collection of programs and configuration.
An Efficient Energy Consumption Scheme Considering Coverage and Connectivity Problem in Wireless Sensor Networks
Authors: Tae-Young Byun
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Many studies have been done to solve the coverage and connectivity problem of the sensor networks with the one-hop neighbor location information. In this paper we propose a simple scheme for the coverage and connectivity problem without any location information. We evaluate the performance of the proposed scheme with analytical models and simulations. The simulation results verify the proposed scheme provides both coverage and connectivity guarantees.
Static and dynamic aspects of cortical somatotopy: A critical evaluation
Authors: Herbert P. Killackey
Venue: Journal of Cognitive Neuroscience (1989)

The demonstration that functional somatotopic maps within the adult neocortex undergo some degree of reorganization following peripheral injury has aroused considerable interest. The evidence for such reorganization in the rat and monkey is reviewed and it is concluded that in both species there is good evidence for limited functional map reorganization in the adult neocortex following peripheral injury. The significance of such functional map reorganization, particularly in terms of whether or not cortical maps are continuously modifiable throughout life, is discussed. It is concluded that the current evidence for map reorganization is best interpreted in terms of the unmasking of preexisting neuronal circuits rather than as evidence of dynamic cortical selection processes. 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
High-Level Power Estimation and Low-Power Design Space Exploration for FPGAs
Authors: Deming Chen, Jason Cong, Yiping Fan, Zhiru Zhang
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In this paper, we present a simultaneous resource allocation and binding algorithm for FPGA power minimization. To fully validate our methodology and result, our work targets a real FPGA architecture ¿ Altera Stratix FPGA [2], which includes generic logic elements, DSP cores, and memories, etc. We design a high-level power estimator for this architecture and evaluate its estimation accuracy against a commercial gate-level power estimator ¿ Quartus II PowerPlay Analyzer [1]. During the synthesis stage, we pay special attention to interconnections and multiplexers. We concentrate on resource allocation and binding tasks because they are the key steps to determine the interconnections. We use a novel approach to explore the design space. Experimental results show that our high-level power estimator is 8.7% away from PowerPlay Analyzer. Meanwhile, we are able to achieve a significant amount of power reduction (32%) with better circuit speed (16%) compared to a traditional resource allocation and binding algorithm.
The virtual node layer: a programming abstraction for wireless sensor networks
Authors: Matthew Brown, Seth Gilbert, Nancy Lynch, Calvin Newport, Tina Nolte, Michael Spindel
Venue: ACM SIGBED Review (2007)

The Virtual Node Layer (VNLayer) programming abstraction provides programmable, predictable automata--virtual nodes--emulated by the low-level network nodes. This simplifies the design and rigorous analysis of applications for the wireless sensor network setting, as the layer can mask much of the uncertainty of the underlying components. In this paper, we define a general VNLayer architecture, and then use this framework to design a practical VNLayer implementation, optimized for real-world use. We then discuss our experience deploying this implementation on a testbed of hand-held computers, and in a custom-built packet-level simulator, and present a sample application--a virtual traffic light--to highlight the power and utility of our abstraction. We conclude with a survey of additional applications that are well-suited to this setting.
A Fault Tolerant Web Service Architecture
Authors: Diego Zuquim Guimaraes Garcia, Maria Beatriz Felgar de Toledo
Venue: Proceedings of the 2007 Latin American Web Conference (2007)

Web services have been pointed as a suitable technology for the development and execution of distributed applications. However, the Web service architecture still lacks facilities to support fault tolerance. The goal of this paper is to propose a fault tolerant Web service architecture. The architecture provides service mediation and monitoring. The main contribution of this paper is the use of Web service standards to include fault tolerance in the Web service architecture.
Image Denoising Using Hybrid Contourlet and Bandelet Transforms
Authors: Beibei Song, Luping Xu, Wenfang Sun
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper proposed a new multiscale and multidirectional image representation method named CBlet transform. It combines the new contourlet transform with the second-generation bandeletzation procedure. Thereinto, the contourlet transform captures image discontinuous points and links them into linear structures, then the bandeletization procedure pursuits the linear structures adaptively and further removes their correlation. The CBlet transform obtains much sparser representation than the new contourlet transform at the same redundancy. Numerical experiments on image denoising show that the proposed CBlet transform can outperform the new contourlet transform both in term of PSNR and in visual quality.
Comparison of classification accuracy using Cohen's Weighted Kappa
Authors: Arie Ben-David
Venue: Expert Systems with Applications: An International Journal (2008)

Many expert systems solve classification problems. While comparing the accuracy of such classifiers, the cost of error must frequently be taken into account. In such cost-sensitive applications just using the percentage of misses as the sole meter for accuracy can be misleading. Typical examples of such problems are medical and military applications, as well as data sets with ordinal (i.e., ordered) class. A new methodology is proposed here for assessing classifiers accuracy. The approach taken is based on Cohen's Kappa statistic. It compensates for classifications that may be due to chance. The use of Kappa is proposed as a standard meter for measuring the accuracy of all multi-valued classification problems. The use of Weighted Kappa enables to effectively deal with cost-sensitive classification. When the cost of error is unknown and can only be roughly estimated, the use of sensitivity analysis with Weighted Kappa is highly recommended.
Avoiding sorting and grouping in processing queries
Authors: Xiaoyu Wang, Mitch Cherniack
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Sorting and grouping are amongst the most costly operations performed during query evaluation. System R [6] used simple inference strategies to determine orderings held of intermediate relations to avoid unnecessary sorting, and to influence join plan selection. Since then, others have proposed using integrity constraint information to infer orderings of intermediate query results. However, these proposals do not consider how to avoid grouping operations by inferring groupings, nor do they consider secondary orderings (where records in the same group satisfy some ordering). In this paper, we introduce a formalism for expressing and reasoning about order properties: ordering and grouping constraints that hold of physical representations of relations. In so doing, we can reason about how the relation is ordered or grouped, both in terms of primary and secondary orders. After formally defining order properties, we introduce a plan refinement algorithm that infers order properties for intermediate and final query results on the basis of those known to hold of query inputs, and then exploits these inferences to avoid unnecessary sorting and grouping. We then show empirical results demonstrating the benefits of plan refinement, and show that the overhead that our algorithm adds to query optimization is low.
Research of the Symplectic Group Classifier Based on Lie Group Machine Learning
Authors: Huixin Fu, Fanzhang Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

This paper describes the theories of symplectic group based on the basic conceptions and theory framework of lie group machine learning (LML), it implements the constructor of symplectic classifier in Lie group machine learning (LML), along with the descriptions of the correlated problems. This contained by: mapping the observed data set in the learning system to the nonempty set G; constructing the corresponding symplectic group structure according to G; applying the obtained symplectic group to the lie group machine learning (LML) model; and forming the symplectic classifiers; testing examples and giving performance results.
Toward an Implementation of the "Form Template Method" Refactoring
Authors: Nicolas Juillerat, Beat Hirsbrunner
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

This paper presents an implementation of the "form template method" refactoring. This transformation has not been automated yet, but has many similarities with other transformations such as clone detection and removal or method extraction. Forming a template method is a difficult process because it has to deal with code statements directly. Few abstractions and algorithms have been investigated yet, compared to transformations dealing with higher level aspects such as the classes, methods, fields and their relations. We present a new algorithm that performs this transformation in a semi-automated way on Java programs. We state the difficulties inherent to this transformation and propose solutions to handle them.
Network Coding Scheme Based on Key Nodes
Authors: Lin Guoqing, Wang Jing, Wang Xinmei
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

With the same routing algorithm and network coding scheme, the complexity of network coding (NC) increases with the network scale. In this paper, a network coding scheme based on key nodes is proposed, which is that only the subnet consists of important nodes adopts NC. Using this scheme, the scale of the network that performs NC is reduced, and the complexity of NC is decreased. In wireless network, choosing the steady-going existing nodes as key nodes can increase the stability of network structure. For Some especial network which can not adopt linear NC, part nodes can be chosen as key nodes to perform NC. For super large network, the backbone nodes can be chosen as key nodes. =
A New Approach to the Evaluation of the Reliability of Digital Systems
Authors: I. Koren
Venue: IEEE Transactions on Computers (1980)

Signal reliability, as a measure of digital systems' reliability, has not been used until recently due to lack of efficient evaluation methods. A new approach to the evaluation of signal reliability is presented in this work. A reliability transfer function of digital systems is defined and a method for its evaluation is presented. This approach provides a new insight into the problem of digital system reliability. Furthermore, it simplifies signal reliability calculations and can easily be mechanized.
Neural Network Ensemble Based on Vowel Classification for Chinese Speaker Recognition
Authors: Bo Qian, Zhen-min Tang, Yan-ping Li, Li-min Xu, Yan Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

As we known, features of speech signal not only reflect the identity information, but also contain the semantical information. In this paper, we describe a novel neural network ensemble architecture based on the finding that the diphthong and multi-vowel in Chinese can approximately be considered as the complex of mono-vowel and transitional part in the standpoint of short-term analysis. Several neural networks are trained, each for the eigenspace of one mono-vowel, and their results are combined by another combinational neural network. The architecture can effectively improve the recognition accuracy by eliminating the disturbance of semantical information. Experimental results show that the recognition accuracy of our proposed approach is higher than conventional methods such as a single neural network and other proposed ensemble structures.
A Composition Approach to Mutual Exclusion Algorithms for Grid Applications
Authors: Julien Sopena, Fabrice Legond-Aubry, Luciana Arantes, Pierre Sens
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

We propose a new composition approach to mutual exclusion algorithms for applications spread over a grid which is composed of a federation of clusters. Taking into account the heterogeneity of communication latency, our hierarchical architecture combines intra and inter cluster algorithms. We focus on token-based algorithms and study different compositions of algorithms. Performance evaluation tests have been conducted on a national grid testbed whose results show that our approach is scalable and that the choice of the most suitable inter cluster algorithm depends on the behavior of the application.
A Comparative Study of Nomadic Mobile Service Provisioning Approaches
Authors: Pravin Pawar, Satish Srirama, Bert-Jan van Beijnum, Aart van Halteren
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

In today's world of pervasive computing, the mobile devices are enriched with a variety of features and being used as a personal information delivery platform. The increased processing, storage and communication capabilities of these devices combined with the latest developments in the area of Service Oriented Architecture enables a new class of services, called Nomadic Mobile Services (NMS). Recent research has resulted in different NMS provisioning approaches; each one employs/defines a different architecture and addresses a different mix of issues. This paper provides a comparative study of three NMS provisioning approaches based on their architectural design, development choices and prototyped applications. Each approach has its own merits considering the applications they aim at. However, in the future, a solution which uses web services for better interoperability and employes proxy approach for better QoS could be a possible technical design.
Level-headed
Authors: Drew McDermott
Venue: Artificial Intelligence (2007)

I don't believe that human-level intelligence is a well defined goal. As the cognitive-science community learns more about thinking and computation, the mileposts will keep changing in ways that we can't predict, as will the esteem we assign to past accomplishments. It would be fun to have a computer that could solve brain teasers as well as the average scientist, but focusing on such things, besides being parochial, overlooks the crucial role language plays in everything humans do, a role we understand hardly at all on a computational level. I am optimistic that we will eventually figure language out, but not without new ideas. Plus, when we can talk to machines, will we understand each other?
A Fuzzy Self-Tuning Algorithm for Depth-Axis Control in Image-Based Visual Servo Control
Authors: Xiao-Jing Shen, Ming Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper is concerned with choosing image features for image-based visual servo control and how a fuzzy self- tuning PI control algorithm is designed to track a planar target with motion along the depth-axis. In this paper, we study a specific class of IBVS problem, in which a camera is constrained to move in the depth-axis(or Z-axis), since depth control is very important in IBVS system. Such a constraint condition makes it possible to find image moments reflecting target depth, and thus leads to a relative simple PI depth controller. The fuzzy self tuning algorithm is introduced to improve the performance of the PI depth controller And the significant properties of the simulation results show that .the fuzzy self tuning algorithm is shown by simulation.
Mitigating DoS attacks against broadcast authentication in wireless sensor networks
Authors: Peng Ning, An Liu, Wenliang Du
Venue: ACM Transactions on Sensor Networks (TOSN) (2008)

Broadcast authentication is a critical security service in wireless sensor networks. There are two general approaches for broadcast authentication in wireless sensor networks: digital signatures and &mu;TESLA-based techniques. However, both signature-based and &mu;TESLA-based broadcast authentication are vulnerable to Denial of Services (DoS) attacks: An attacker can inject bogus broadcast packets to force sensor nodes to perform expensive signature verifications (in case of signature-based broadcast authentication) or packet forwarding (in case of &mu;TESLA-based broadcast authentication), thus exhausting their limited battery power. This paper presents an efficient mechanism called message-specific puzzle to mitigate such DoS attacks. In addition to signature-based or &mu;TESLA-based broadcast authentication, this approach adds a weak authenticator in each broadcast packet, which can be efficiently verified by a regular sensor node, but takes a computationally powerful attacker a substantial amount of time to forge. Upon receiving a broadcast packet, each sensor node first verifies the weak authenticator, and performs the expensive signature verification (in signature-based broadcast authentication) or packet forwarding (in &mu;TESLA-based broadcast authentication) only when the weak authenticator is valid. A weak authenticator cannot be precomputed without a non-reusable (or short-lived) key disclosed only in a valid packet. Even if an attacker has intensive computational resources to forge one or more weak authenticators, it is difficult to reuse these forged weak authenticators. Thus, this weak authentication mechanism substantially increases the difficulty of launching successful DoS attacks against signature-based or &mu;TESLA-based broadcast authentication. A limitation of this approach is that it requires a powerful sender and introduces sender-side delay. This article also reports an implementation of the proposed techniques on TinyOS, as well as initial experimental evaluation in a network of MICAz motes.
Core-Based Testing of Multiprocessor System-on-Chips Utilizing Hierarchical Functional Buses
Authors: Fawnizu Azmadi Hussin, Tomokazu Yoneda, Alex Orailoglu, Hideo Fujiwara
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

An integrated test scheduling methodology for multiprocessor System-on-Chips (SOC) utilizing the functional buses for test data delivery is described. The proposed methodology handles both flat bus single processor SOC and hierarchical bus multiprocessor SOC. It is based on a resource graph manipulation and a packet-based packet set scheduling methodology. The resource graph is decomposed into a set of test configuration graphs, which are then used to determine the optimum test configurations and test delivery schedule under a given power constraint. In order to validate the effectiveness of the proposed methodology, a number of experiments are run on several modified benchmark circuits. The results clearly underscore the advantages of the proposed methodology.
Efficiently Accessing Remote Resources in Distributed Real-Time Systems
Authors: Paul S. Usher, Neil C. Audsley
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

This paper examines the structures that are used by traditional real-time and networked operating systems in order to show that they are poorly suited to providing efficient access to remote devices. It also argues that efficiency can be improved by being more specific and by making better use of the network mediums characteristics.
Presentation and Correction of Errors in Operating System Measurements
Authors: P. Bourret
Venue: IEEE Transactions on Software Engineering (1980)

This cofrespondence presents two ldnds of errors which occur when data supplied by software monitors are gathered. Various ways of assessing their effects are suggested.
Fda -a scalable evolutionary algorithm for the optimization of additively decomposed functions
Authors: Heinz Mühlenbein, Thilo Mahnig
Venue: Evolutionary Computation (1999)

The Factorized Distribution Algorithm (FDA) is an evolutionary algorithm which combines mutation and recombination by using a distribution. The distribution is estimated from a set of selected points. In general, a discrete distribution defined for n binary variables has 2n parameters. Therefore it is too expensive to compute. For additively decomposed discrete functions (ADFs) there exist algorithms which factor the distribution into conditional and marginal distributions. This factorization is used by FDA. The scaling of FDA is investigated theoretically and numerically. The scaling depends on the ADF structure and the specific assignment of function values. Difficult functions on a chain or a tree structure are solved in about O(n√n) operations. More standard genetic algorithms are not able to optimize these functions. FDA is not restricted to exact factorizations. It also works for approximate factorizations as is shown for a circle and a grid structure. By using results from Bayes networks, FDA is extended to LFDA. LFDA computes an approximate factorization using only the data, not the ADF structure. The scaling of LFDA is compared to the scaling of FDA.