ppxscal/embedding_network huggingface dataset:
Interconnect design considerations for large NUCA caches
Authors: Naveen Muralimanohar, Rajeev Balasubramonian
Venue: ACM SIGARCH Computer Architecture News (2007)

The ever increasing sizes of on-chip caches and the growing domination of wire delay necessitate significant changes to cache hierarchy design methodologies. Many recent proposals advocate splitting the cache into a large number of banks and employing a network-on-chip (NoC) to allow fast access to nearby banks (referred to as Non-Uniform Cache Architectures--NUCA). Most studies on NUCA organizations have assumed a generic NoC and focused on logical policies for cache block placement, movement, and search. Since wire/router delay and power are major limiting factors in modern processors, this work focuses on interconnect design and its influence on NUCA performance and power. We extend the widely-used CACTI cache modeling tool to take network design parameters into account. With these overheads appropriately accounted for, the optimal cache organization is typically very different from that assumed in prior NUCA studies. To alleviate the interconnect delay bottleneck, we propose novel cache access optimizations that introduce heterogeneity within the inter-bank network. The careful consideration of interconnect choices for a large cache results in a 51% performance improvement over a baseline generic NoC and the introduction of heterogeneity within the network yields an additional 11-15% performance improvement.
Extended RBAC - Based Design and Implementation for a Secure Data Warehouse
Authors: Bhavani Thuraisingham, Srinivasan Iyer
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

This paper first discusses security issues for data warehousing. In particular, issues on building a secure data warehouse, secure data warehousing technologies as well as design issues are discussed. Our design of a secure data warehouse that enforces an Extended RBAC Policy is described next. Finally directions for secure data warehouses are discussed.
On the origins of the synthetic mind: working models, mechanisms, and simulations
Authors: Steven Wagner
Venue:  (2006)

This dissertation reconsiders the nature of scientific models through an historical study of the development of electronic models of the brain by Cybernetics researchers in the 1940s. By examining how these unique models were used in the brain sciences, it develops the concept of a "working model" for the brain sciences. Working models differ from theoretical models in that they are subject to manipulation and interactive experimentation, i.e. they are themselves objects of study and part of material culture. While these electronic brains are often disparaged by historians as toys and publicity stunts, I argue that they mediated between physiological theories of neurons and psychological theories of behavior so as to leverage their compelling material performances against the lack of observational data and sparse theoretical connections between neurology and psychology. I further argue that working models might be used by cognitive science to better understand how the brain develops performative representations of the world.
Mobile Media Content Sharing in UPnP-Based Home Network Environment
Authors: Wei-Shun Liao, Yen-Ju Huang, Chih-Lin Hu
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Many modern handheld devices are able to take and store media contents, but are usually equipped with small panels and poor player utilities. To achieve high quality playing performance, users often need to transfer media contents to external powerful devices with a series of cumbersome operations of connection setup and content transfer. In this paper, we present a mobile content sharing mechanism based on UPnP framework and wireless technology. As a result, users could conveniently share media contents stored in mobile devices and play them by other home networked devices. The demonstration result shows that the developed mechanism is practicable and easy to use.
Error Recovery in Parallel Systems of Pipelined Processors with Caches
Authors: Jeng-Ping Lin, Shih-Chang Wang, Sy-Yen Kuo
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

This paper examines the problem of recovering from processor transient faults in pipelined multiprocessor systems. A pipelined machine allows out of order instruction execution and branch prediction to increase performance, thus a precise computation state may not be available. We propose a modified scheme to implement the precise computation state in a pipelined machine. The goal of this research is to implement checkpointing and rollback for error recovery in a pipelined system based on the technique to achieving precise computation state. Detailed analysis has been performed to demonstrate the effectiveness of this method.
Applying a Symbolic Approach for SWN Enabling Test to Workflow Models
Authors: Lorenzo Capra
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

Colored Petri Nets are a formalism widely used to specify and analyze workflow models. Finding the set of transition color instances enabled in a given marking is a basic task affecting reachability graph construction, modelchecking, and especially discrete-event simulation, which is an interesting alternative when analytical solutions are unfeasible due to state-space explosion. A recently introduced symbolic approach to colored transition enabling test is the kernel for the efficient implementation of several algorithms for the analysis of SWN (a Stochastic CPN flavor retaining power that exploits behavioral symmetries) based on statespace exploration. An application example of the symbolic enabling test for efficient simulation of SWN workflow models is presented. The example shows that the technique can be easily integrated to the SWN symbolic firing rule.
FP/EDF versus FP/FIFO Local Scheduling and Probabilistic QoS Guarantees in a Bluetooth Piconet
Authors: Karima Maalaoui, Leila Azouz Saidane
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Efficient communication in Bluetooth networks requires a good design of intra and inter-piconet scheduling solutions. Mathematical performance analysis of such solutions is very important. But, due to the complexity of the Bluetooth MAC, they have been analyzed mostly via simulations. We present analytic results regarding performance evaluation of a Bluetooth piconet, based on the M/G/1 queue with batch arrivals and vacation times. We introduce a solution to support various traffics with QoS guaranties. We focus on two application constraints: the priority of a message and its end-to-end delivery deadline. We deal with two new local scheduling disciplines that we propose so far. The first is a combination of the class based priority queuing (PQ) and FIFO. The second is a combination of PQ and EDF. PQ is used between classes while FIFO and EDF are used within a class. We focus our interest to providing Quality of Service (QoS) guarantees to various classes of soft real-time applications by using a probabilistic approach. The waiting time distribution is then computed to obtain the probability that the response time doesn't exceed a given deadline.
Automatic understanding of selected diseases on the basis of structural analysis of medical images
Authors: M. Ogiela
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The goal of this paper is a presentation of the possibilities of the application of syntactic methods to the recognition of the local stenoses of the lumen of coronary arteries, and to the detection of pathological signs in upper parts of ureter ducts and renal calyxes. An analysis of the correct morphology of these structures is possible thanks to the application of sequence and tree methods from the group of syntactic methods of pattern recognition. In the case of the analysis of coronary artery images, the main objective is a computer-aided early diagnosis of the different forms of cardiac ischemic diseases. In the analysis of kidney radiograms the main goal is the recognition of local irregularities in ureter lumens, and an examination of the morphology of renal pelvis and calyxes.
CMP: A UML Context Modeling Profile for Mobile Distributed Systems
Authors: Christof Simons
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper proposes the Context Modeling Profile (CMP), a lightweight UML extension, as a visual language for context models in mobile distributed systems. The resulting models visualize meta information of the context, i.e. source and validity of context information, and reflect privacy restrictions. The profile provides several well-formedness rules for context models supporting the development of context-aware mobile applications through an adequate visual modeling language. A case study is used to illustrate the approach.
Supporting Pluggable Configuration Algorithms in PCOM
Authors: Marcus Handte, Klaus Herrmann, Gregor Schiele, Christian Becker
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Pervasive Computing envisions distributed applications that optimally leverage the resources present in their ever-changing execution environment. To ease the development of pervasive applications, we have created a pervasive component system (PCOM). PCOM automates the configuration and runtime adaptation of a component-based application using a builtin distributed configuration algorithm. In this paper, we present an architectural extension that allows switching between different algorithms. This enables PCOM to dynamically select an algorithm that suits the computational resources present in an environment. To validate the extended architecture, we compare the overheads of a distributed and a centralized configuration algorithm in two different environments.
The Visual Side of Wikipedia
Authors: Fernanda B. Viegas
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The name "Wikipedia" has been associated with terms such as collaboration, volunteers, reliability, vandalism, and edit-war. Fewer people might think of "images," "maps," "diagrams," "illustrations" in this context. This paper presents the burgeoning but underexplored visual side of the online encyclopedia. A survey conducted with image contributors to Wikipedia reveals key differences in collaborating around images as opposed to text. The results suggest that, even though image editing is a more isolated activity, somewhat shielded from vandalism, the sense of community is an important motivation for image contributors. By examining how contributors are appropriating text-oriented wiki technology to support collective editing around visual materials, this paper reveals the potential and some of the limitations of wikis in the realm of visual collaboration.
Flow-level stability of data networks with non-convex and time-varying rate regions
Authors: Jiaping Liu, Alexandre Proutière, Yung Yi, Mung Chiang, H. Vincent Poor
Venue: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2007)

In this paper we characterize flow-level stochastic stability for networks with non-convex or time-varying rate regions underresource allocation based on utility maximization. Similar to prior works on flow-level stability, we consider exogenous data arrivals with finite workloads. However, to model many realistic situations, the rate region, which constrains the feasibility of resource allocation, may be either non-convex or time-varying. When the rate region is fixed but non-convex, we derive sufficient and necessary conditions for stability, which coincide when the set of allocated rate vectors has continuous contours. When the rate region is time-varying according to some stationary, ergodic process, we derive the precise stability region. In both cases,the size of the stability region depends on the resource allocation policy, in particular, on the fairness parameter in ∝-fair utility maximization. This is in sharp contrast with the substantial existing literature on stability under fixed and convex rate regions, in which the stability region coincides with the rate region for many utility-based resource allocation schemes, independently of the value of the fairness parameter. We further investigate the tradeoff between fairness and stability when rate region is non-convex or time-varying. Numerical examples of both wired and wireless networks are provided to illustrate the new stability regions and tradeoffs proved in the paper.
Formal Validation of Hierarchical State Machines against Expectations
Authors: Ian Toyn, Andy Galloway
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

This paper explains some analyses that can be performed on a hierarchical finite state machine to validate that it performs as intended. Such a hierarchical state machine has transitions between states, triggered by conditions over inputs, with outputs determined per state in terms of inputs. Intentions are captured per state as expectations on input values. These expectations are expressed using the same condition language as transition triggers, extended to constrain rates of change as well as ranges. The analyses determine whether the expectations are consistent and whether the state machine conforms to the expectations. For the analyses to find no problems, the explicit expectations on the root state will be at least as strong as the implicit expectations of the state machine. One way of using the analyses is to reveal these implicit expectations. The analyses have been automated for statecharts built with The MathWorks' Stateflow tool.
Towards Reliable Computation of Large-Scale Market-Based Optimal Power Flow
Authors: Hongye Wang, Robert J. Thomas
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The deregulated electricity market calls for robust OPF tools that can provide (a) deterministic convergence, (b) accurate computation of a variety of nodal prices, (c) support of continuous costs as well as discrete bids and offers, (d) full active and reactive power flow modeling of large-scale systems, and (e) satisfactory worst-case performance that meets the real-time dispatching requirement. For historical reasons, most prior research on OPF has focused on performance issues, without much treatment of requirements (a)-(c). This paper discusses these new challenges and presents two new algorithms for reliable computation of large-scale market-based OPF: trust-region based augmented Lagrangian method (TRALM) and step-controlled primal-dual interior point method (SCIPM). The former is more theoretically rigid while the latter is more effective in practice. The new algorithms, along with several existing ones, are tested and compared using largescale power system models.
Survey of Six Myths and Oversights about Distributed Hash Tables' Security
Authors: Sylvain Dahan, Mitsuhisa Sato
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Distributed Hash Tables (DHT) was not designed to be secure against malicious users. But some secure systems like trust and reputation management algorithms trustDHTwith their data. Several propositions have been made to make DHTs appear secure but they fail in practice. We review some of those propositions and explain why they do not work. Our main conclusion is that DHT should not be used to create secure systems.
Face Recognition Algorithm Using the Discrete Gabor Transform
Authors: Gualberto Aguilar-Torres, Gabriel Sanchez-Perez, Mariko Nakano-Miyatake, Hector Perez-Meana
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

This paper proposes a Face Recognition Algorithm in which the Discrete Gabor transform is used to extract the image face features vector that is then feed into a multilayer perceptron to be carried out the recognition task. The features vector, estimated using the Gabor Transform, presents a small intra-person variation while the inter-persons variation is considerably large. This fact provides robustness against changes in illumination, wardrobe, facial expressions, scale, and position inside the captured image, as well as inclination, noise contamination and filtering. Proposed scheme also provides some tolerance to changes on the age of the person under analysis. Evaluation results using the proposed scheme with identification and verification configurations are given to show the desirable features of proposed algorithm.
Applying the Affinity Research Group model to computer science research projects
Authors: P. J. Teller
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The Affinity Research Group model provides students with opportunities to learn, use, and integrate the knowledge and skills required for research with the knowledge and skills required for cooperative work. Although a conceptually attractive vehicle with which to involve undergraduates in research, retain them, and foster their interest in higher education, an often posed question relates to the feasibility of applying the model in a field like computer science, in which it is often the case that a solid academic foundation is required in order for a student to be involved in research. This paper addresses this question by describing how the model has been applied to computer science research projects that involve students with different skill levels and experience. In particular, it presents example structured tasks and related activities that illustrate how students develop domain expertise, gain an understanding and appreciation of the research process and its practice, and acquire team, communication, problem-solving, and higher-level thinking skills.
Implementing large scale curricular changes-the Drexel experience
Authors: R. G. Quinn
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

In 1988, Drexel University began a comprehensive experimental project designed to enhance its undergraduate engineering curriculum. The project called for the creation of a major paradigm shift in which the environment and all activities would focus on the students as emerging professional engineers with the faculty serving as their mentors. The primary objectives were to provide the student an integrated exposure, throughout the first two years, to a common core of elements which the faculty believe will be essential to successful practice in the next century. Achievement of these objectives required faculty to use and/or develop a combination of several different teaching methodologies and to totally reorganize the subject matter. In anticipation that the magnitude of these changes might cause difficulties, the experiment provided for a properly scaled incremental approach with continuous evaluation and options to adopt or reject the new curriculum in whole or in part, at the conclusion of the project. The results of the experiment were extremely positive. Student achievement and enthusiasm were high. Strong bonds were established with their faculty mentors from thirteen different departments who found the experience to be both challenging and rewarding. Consequently, the faculty approved a plan to revise the total curriculum of all engineering departments. Each department is now restructuring its upper division curriculum using the experimental program as the common lower-division core. Full scale implementation began with the entering class in 1994. The implementation of such fundamental, large scale changes is complicated by the diversity of the constituencies involved and beset with a variety of challenges and issues. These range over a broad spectrum from matters relating to academic and administrative authority to faculty development and rewards, to the allocation of fiscal physical and human resources. 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
Discriminative learning for differing training and test distributions
Authors: Steffen Bickel, Michael Brückner, Tobias Scheffer
Venue: Proceedings of the 24th international conference on Machine learning (2007)

We address classification problems for which the training instances are governed by a distribution that is allowed to differ arbitrarily from the test distribution---problems also referred to as classification under covariate shift. We derive a solution that is purely discriminative: neither training nor test distribution are modeled explicitly. We formulate the general problem of learning under covariate shift as an integrated optimization problem. We derive a kernel logistic regression classifier for differing training and test distributions.
Multi-level project work; a study in collaboration
Authors: M. Daniels
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

This is a description of our latest effort to find new education forms. We have a long experience with running large projects (Daniels and Asplund, 1999), but wanted to expand the concept into an interdisciplinary setting. By combing three different student groups we have been able to formulate a project aiming at building robots from scratch that will participate in the robot soccer championships. This complex project resembles a realistic industry development that covers the, for us, usual computer science aspect, as well as interfacing with electronic hardware and mechanical construction.
Performance of OFDM receivers in presence of nonlinear power amplifiers
Authors: M. Eslami, H. Shafiee
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The nonlinear response of power amplifiers in radio transmitters affects the bit error rate performance of OFDM communication systems. We study traveling wave tube and soft-limiter amplifiers, and obtain bit-error rates of an OFDM system using analytical techniques as well as computer simulation when the operation of the receiver blocks is taken into account. This is done with and without a predistorter in the transmitter. Computer simulations are done for a communication system designed based on the IEEE 802.11a standard for wireless local area networks. Good agreement between the predicted analytical values and simulation results are obtained, especially at high channel SNRs.
Comparison of 3D Segmentation Algorithms for Medical Imaging
Authors: Hakan Bulu, Adil Alpkocak
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

In this paper we present an evaluation of four different 3D segmentation algorithms with respect to their performance on three different CT Data Sets. The segmentation algorithms evaluated in this study are seeded region growing, volumetric segmentation using weibull E-SD fields, automatic multilevel thresholding by using OTSU method and unseeded region growing. The main results gained from our experimentation are given.