ppxscal/embedding_network huggingface dataset:
Writing as an instrument for modeling students learning attitude
Authors: M. Feldgen
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

A design project exposes students to the realities of the software developing practice. Also, teamwork and cooperative learning are essential ingredients to reflect on what students are learning. But it becomes a challenge in a commuter school with large classes. It is also not uncommon for students to have significant out-of-school commitments including work and family. The authors introduced the study of artifacts into a creative problem solving strategy in their education: a hardware dissection as the first team assignment. They found that the dissection assignment made students able to draw the necessary analogies between the unfamiliar task of software design and the more familiar task of assembling a device. However, adequate in-class team assignments and individual writing assignments must support this out-of-class assignment.
Spinning stories: the development of the small histories project as an online facilitator of multiple life stories
Authors: Stefan Schutt
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

This paper focuses on the Small Histories research project, a multi-user, database-powered online system for the uploading, storage, display and juxtaposition of multiple individuals' life histories. It discusses issues encountered in the project's initial interface design and testing stage, particularly around the display of users' stories, use of metadata and choices of web technologies. The paper also explores broader issues connected with the creation of narratives via the Small Histories system.
Adaptive window size image denoising based on ICI rule
Authors: K. Egiazarian
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

An algorithm for image noise-removal based on local adaptive window size filtering is developed. Two features for use in local spatial/transform-domain filtering are suggested. First, filtering is performed on images corrupted not only by additive white noise, but also by image-dependent (e.g. film-grain noise) or multiplicative noise. Second, the used transforms are equipped with a varying adaptive window size obtained by the intersection of confidence intervals (ICI) rule. Finally, we combine all estimates available for each pixel from neighboring overlapping windows by weighted averaging these estimates. Comparison of the algorithm with the known techniques for noise removal from images shows the advantage of the new algorithm, both quantitatively and visually.
Mapping a Local Web Domain
Authors: Weimao Ke, Tiago Simas
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

In this study, we crawled a local Web domain, created its graph representation, and analyzed the network structure. The results of network analysis revealed local scalefree patterns consistent with previous research on the Web. To discover topical communities of the local domain, linkbased co-citation analysis was performed to measure pairwise similarities. Based on the co-citation graph, a visualization was produced to map the networked domain semantically. All of this offers a way to investigate a local Web structure and to make it more intuitively understandable.
Dynamic Text Filtering for Improving the Usability of Alphasliders on Small Screens
Authors: Thorsten Buring, Jens Gerken, Harald Reiterer
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Previous research has shown that Alphasliders are an effective tool for searching an alphabetically sorted list when only limited screen space is available for the graphical user interface. To improve user satisfaction, we propose equipping the widget with a novel text filter to dynamically limit the slider range. In this way, users are supported in locating target items and in identifying records that are missing. The results of a comparative user evaluation run on a Personal Digital Assistant showed that 8 out of 12 participants preferred the filter widget to the classic interface. We further suggest an enhanced Alphaslider design to speed up user interaction.
Smart Homecare System for Health Tele-monitoring
Authors: Peter Leijdekkers, Valerie Gay, Elaine Lawrence
Venue: Proceedings of the First International Conference on the Digital Society (2007)

An increasing aged population worldwide puts our medical capabilities to the test. Research and commercial groups are investigating novel ways to care for the aged and chronically ill both in their own homes and in care facilities. This paper describes a prototype we have developed for remote healthcare monitoring. This personalized smart homecare system uses smart phones, wireless sensors, web servers and IP webcams. To illustrate the functionality of the prototype we describe a series of typical tele-health monitoring scenarios.
Peer Review of Animations Developed by Students
Authors: Rainer Oechsle, Thiemo Morth
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

This paper describes the project ''Visual Knowledge Communication'', a joint project that started recently. The partners are psychologists and computer scientists from four universities of the German state Rhineland-Palatinate. The starting point for the project was the fact that visualizations have attracted considerable interest in psychology as well as computer science within the last years. However, psychologists and computer scientists pursued their investigations independently from each other in the past. This project has as its main goal the support and fostering of cooperation between psychologists and computer scientists in several visualization research projects. The paper sketches the overall project. It then discusses in more detail the authors' subproject which deals with a peer review process for animations developed by students. The basic ideas, the main goals, and the project plan are described. This paper is a work-in-progress report. Therefore, it does not contain any results.
Novel inverse methods in land mine imaging
Authors: T. P. Weldon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The imaging of buried land mines continues to present significant signal-processing challenges in the development of inverse methods for the detection of plastic mines buried in soil. To address this difficult problem, mathematical advances in the development of the elliptic systems method are used to generate images of the buried land mines. The-proposed approach adapts earlier methods, successfully applied in laser tomography of breast tumors using the diffusion equation, to the present problem of land mine imaging using the Helmholtz equation. The images generated by the new method represent electromagnetic properties of underground regions, providing effective differentiation of plastic land mines from surrounding soil. Experimental results are presented to demonstrate the new method.
First to market is not everything: an analysis of preferential attachment with fitness
Authors: Christian Borgs, Jennifer Chayes, Constantinos Daskalakis, Sebastien Roch
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the networks of interest, such as the Internet,the web graph, social networks or online communities. To this end, preferential attachment, in which the popularity (or relevance) of a node is determined by its degree, is a well-known and appealing random graph model, whose predictions are in accordance with experiments on the web graph and several social networks. However, its central assumption, that the popularity of the nodes dependsonly on their degree, is not a realistic one, since every node has potentially some intrinsic quality which can differentiate its attractiveness from other nodes with similar degrees. In this paper, we provide a rigorous analysis of preferential attachment with fitness, suggested by Bianconi and Barabási and studied by Motwani and Xu, in which the degree of a vertex is scaled by its quality to determine its attractiveness. Including quality considerations in the classical preferential attachment model provides a much more realistic description of many complex networks, such as the web graph, and allows toobserve a much richer behavior in the growth dynamics of these networks. Specifically, depending on the shape of the distributionfrom which the qualities of the vertices are drawn, we observe three distinct phases, namely a first-mover-advantage phase, afit-get-richer phase and an innovation-pays-offphase. We precisely characterize the properties of the quality distribution that result in each of these phases and we computethe exact growth dynamics for each phase. The dynamics provide rich information about the quality of the vertices, which can bevery useful in many practical contexts, including ranking algorithms for the web, recommendation algorithms, as well as thestudy of social networks.
Competitive Strategy, Economics and IS: An Introduction to the Mini-Track
Authors: Eric K. Clemons, Rajiv M. Dewan, Robert J. Kauffman
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The mini-track kicks off with papers that involve managerial decision-making strategies for software development and products, and new IT investments. V. C. Choudhary, author of "Software as a Service: Implications for Investment in Software Development," models firm decision-making on the adoption of alter-native approaches to selling software. The results deal with the differences in optimal investments in software, and the related pricing and market coverage choices for different licensing approaches. Then B. Iyer, C.H. Lee, and D. Dreyfuss, in "Competing in the Era of Emergent Architecture: The Case of Packaged Software Industry," explore packaged software industry clusters with a software stack perspective. They show why firms with complementary products are better performers than those without. The session closes with "Modeling Network Decisions under Uncertainty: Countervailing Externalities and Embedded Options," by Robert J. Kauffman and Ajay Kumar, who model IT investment strategy decision-making settings that involve positive and negative externalities tradeoffs, for which real op-tions thinking result in value-maximizing payoffs.
An Analysis Framework for Transient-Error Tolerance
Authors: John P. Hayes, Ilia Polian, Bernd Becker
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

Transient or soft errors are an increasing problem in mainstream microelectronics. We propose a framework for modeling transient-error tolerance (TET) in logic circuits. We classify transient errors as critical or non-critical according to their impact on circuit behavior, such as their ability to disturb the internal state for specified periods of time. We introduce a metric called the critical soft-error rate (CSER) as an alternative to conventional SER, and present some analysis strategies based on CSER. This approach employs a new single transient fault (STF) model, which is defined in terms of a temporary stuck-at fault and its associated circuit state. Although basically technology-independent, STFs can be extended with low-level physical attributes. With STFs, we can estimate the transient error probability perr of a circuit's nodes, as well as various measures of error susceptibility and TET. We demonstrate the use of STFs with combinational and sequential circuits, including several types of adders. We also present a systematic hardening strategy that uses perr as a guide to improving TET.
Skeleton Pruning by Contour Partitioning with Discrete Curve Evolution
Authors: Xiang Bai Longin Jan Latecki
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

In this paper, we introduce a new skeleton pruning method based on contour partitioning. Any contour partition can be used, but the partitions obtained by Discrete Curve Evolution (DCE) yield excellent results. The theoretical properties and the experiments presented demonstrate that obtained skeletons are in accord with human visual perception and stable, even in the presence of significant noise and shape variations, and have the same topology as the original skeletons. In particular, we have proven that the proposed approach never produces spurious branches, which are common when using the known skeleton pruning methods. Moreover, the proposed pruning method does not displace the skeleton points. Consequently, all skeleton points are centers of maximal disks. Again, many existing methods displace skeleton points in order to produces pruned skeletons.
Multiagent service architectures for bus fleet management
Authors: Alberto Fernández, Sascha Ossowski, Eduardo Alonso
Venue: Integrated Computer-Aided Engineering (2004)

Decision Support Systems provide assistance to humans involved in complex decision-making processes. They are particularly relevant in domains where human operators have to take operational decisions regarding the management of complex industrial or environmental processes. In these applications, Decision-support agents are responsible for parts of the decision-making process in a (semi-)autonomous (individually) rational fashion: they collect and facilitate decision relevant data, but also provide advanced reasoning services to analyse the meaning of this information, and make it available to the decision-maker in the course of flexible, semantically rich dialogues. Next-generation agent-based DSS aim at an open architecture to allow for a dynamic integration of more and better decision support services. In this article, we present a multiagent service architecture as a first step towards this goal. Our approach draws upon the latest FIPA specifications for agent and service interoperability. By mapping FIPA key abstractions - its agent communication language, directory service and, in particular, its service description model - to the requirements of agent-based Decision Support Systems, we identify potential shortcomings, and show how they can be overcome. We illustrate our approach in the domain of bus fleet management.
Border identification for power system security assessment using neural network inversion: an overview
Authors: I. N. Kassabalidis, M. A. El-Sharkawi
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Knowledge of the dynamic security border can provide an operator with valuable information on how to safely steer the power system away from vulnerable operating regions. The large set of non-linear differential equations that describe modern large-scale power systems makes it difficult to determine the security border either analytically or numerically in real time. As an alternative, neural networks trained off line on emulator data can provide a commensurate representation of the system transfer function, while significantly decreasing evaluation time. Using neural network inversion, sets of input points corresponding to a fixed output can be evaluated quickly. Different inversion procedures and their properties are reviewed here. We also review various metrics used for determining whether sufficient coverage of the border is achieved. Finally, we illustrate the use of border identification for preventive control when feature selection is initially performed to reduce the dimensionality of the input space.
Herding cats: managing a mobile UNIX platform
Authors: Maarten Thibaut, Wout Mertens
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

Laptops running UNIX operating systems are gaining market share. This leads to more sysadmins being asked to support these systems. This paper describes the major technical decisions reached to facilitate the pilot roll out of a mobile Mac OS X platform. We explain which choices we made and why. We also list the main problems we encountered and how they were tackled. We show why in the environment of a customer support organization at Cisco, a file management tool with tripwire-like capabilities is needed. Radmind appears to be the only software base meeting these requirements. We show how the radmind suite can be extended and integrated to suit mobile clients in an enterprise environment. We provide solutions to automate asset tracking and the maintenance of encrypted home directory disk images. We draw conclusions and list the lessons learnt.
Research on Theoretical System and Technology Frame of New Generation Productivity Based on the Network Cooperation
Authors: KE Xin-sheng, LI Yuan
Venue: Proceedings of the Second International Conference on Systems (2007)

There exists many problems in network society. The information is inundant, lack of pertinence, not visual and hard to understand. These problems can lead to difficult network cooperation of affairs and directly affect the productivity level of a city. This paper conducts an analysis upon the features and developing trend of productivity, and sets up the theoretical system of the new generation productivity, on which basis furthermore the paper analyzes the technology frame to develop the new generation productivity.
Topological Generators and Cut-Graphs of Arbitrary Triangle Meshes
Authors: Giuseppe Patane, Michela Spagnuolo, Bianca Falcidieno
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

Recent advances in the parameterization and adaptive sampling of disc-like surfaces have brought a renewed interest on the global parameterization problem and, more specifically, on the cut-graph search. This paper focuses on the calculation of a family of generators and cut-graphs for the global parameterization of arbitrary triangle meshes. This result is achieved by combining the construction of harmonic scalar fields f : M\gt R of known maxima and minima with the quasi Morse-Smale complex of (M, f). The proposed technique has a simple implementation and outperforms previous work in terms of smoothness of the cut-graphs, stability with respect to the surface sampling, tessellation, topological noise (e.g., tiny handles), and capability of handling boundary components. Since we generate a family of cut-graphs, we also provide a comparison between the parameterizations of M induced by two cut-graphs.
Parasitic-aware analytical modeling of integrated CMOS inductively degenerated narrow-band low noise amplifiers
Authors: Tamer Ragheb, Arthur Nieuwoudt, Yehia Massoud
Venue: Analog Integrated Circuits and Signal Processing (2007)

In this paper, we present an analytical modeling methodology for fully integrated inductively-degenerated CMOS narrow-band cascode Low Noise Amplifiers (LNA) that captures short channel transistor effects to enable rapid design space exploration in current and future process technologies. The modeling methodology captures the impact of parasitics on passive components, ESD-protection structures, and devices to accurately predict both impedance matching and noise figure. Our modeling is suitable for numerical optimization and fully automated synthesis for LNAs. The results indicate that the methodology models ESD-protected LNA circuits with 47.9% better accuracy in noise figure when compared with several current analytical modeling techniques with four orders of magnitude improvement in simulation time over circuit-level simulation. Given its speed and accuracy, the analytical modeling methodology is well-suited for design space exploration.
Zero-knowledge from secure multiparty computation
Authors: Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We present a general construction of a zero-knowledge proof for an NP relation R(x,w) which only makes a black-box use of a secure protocol for a related multi-partyfunctionality f. The latter protocol is only required to be secure against a small number of "honest but curious" players. As an application, we can translate previous results on the efficiency of secure multiparty computation to the domain of zero-knowledge, improving over previous constructions of efficient zero-knowledge proofs. In particular, if verifying R on a witness of length m can be done by a circuit C of size s, and assuming one-way functions exist, we get the following types of zero-knowledge proof protocols. Approaching the witness length. If C has constant depth over ∧,∨,⊕, - gates of unbounded fan-in, we get a zero-knowledge protocol with communication complexity m·poly(k)·polylog(s), where k is a security parameter. Such a protocol can be implemented in either the standard interactive model or, following a trusted setup, in a non-interactive model. "Constant-rate" zero-knowledge. For an arbitrary circuit C of size s and a bounded fan-in, we geta zero-knowledge protocol with communication complexity O(s)+poly(k). Thus, for large circuits, the ratio between the communication complexity and the circuit size approaches a constant. This improves over the O(ks) complexity of the best previous protocols.
Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
Authors: R. Andreani, E. G. Birgin, J. M. Mart&#x00ed;nez, M. L. Schuverdt
Venue: Mathematical Programming: Series A and B (2007)

Two Augmented Lagrangian algorithms for solving KKT systems are introduced. The algorithms differ in the way in which penalty parameters are updated. Possibly infeasible accumulation points are characterized. It is proved that feasible limit points that satisfy the Constant Positive Linear Dependence constraint qualification are KKT solutions. Boundedness of the penalty parameters is proved under suitable assumptions. Numerical experiments are presented.
An Automatic Framework for Efficient Software Performance Evaluation and Optimization
Authors: Chih-Chieh Hsu, Michael Devetsikiotis
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

Performance evaluation has been an important part of software development. Fast and accurate software performance evaluation can help not only in understanding the behavior of software during development, but also in capacity planning during deployment. In this paper, we propose an automatic framework that can be used to optimize software performance indicators. For optimization, we use Response Surface Methodology (RSM) for its simplicity and its ability to describe the behavior of a system in a whole neighborhood. To efficiently obtain the response data for different parameter settings, a reusable Importance Sampling (IS) simulation and testing method can be applied. We describe here this novel method based on a combined Response Surface and Importance Sampling (RS-IS) framework and we illustrate its usefulness via simulated examples that minimize total cost in a capacity planning problem.
On ℤ4-linear codes with the parameters of Reed-Muller codes
Authors: F. I. Solov'Eva
Venue: Problems of Information Transmission (2007)

For any pair of integers r and m, 0 ¿ r ¿ m, we construct a class of quaternary linear codes whose binary images under the Gray map are codes with the parameters of the classical rth-order Reed-Muller code RM(r, m).