ppxscal/embedding_network huggingface dataset:
Recovery Schemes for Fast Fault Recovery on GMPLS Network
Authors: Kisu Kim, Won-Hyuk Lee, Ki-Sung Yu, Jae-Yong Lee, Seongjin Ahn, Jin-Wook Chung
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

In this research, we proposed two types of fault recovery schemes designed by combining the protection and the restoration methods in order to increase the survivability of GMPLS networks. The first method is a transformation of the 1+1 protection method where it consumes more resources than the 1+1 protection method but has a faster fault recovery speed. The second method is a combination of the 1+1 protection method and the restoration method and can enhance the performance after recoveries. Although the two methods proposed in this paper consume more resources than the ones before, they have outstanding recovery time and performance after recoveries.
Flood Emergency Interaction and Visualization System
Authors: Rui Nóbrega, André Sabino, Armanda Rodrigues, Nuno Correia
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

In this paper we describe a visualization system for an emergency simulation. We start by presenting a flooding emergency case scenario and all the elements that are involved in it. Then we describe the design decisions that were made in order to create a credible representation of the scene. This includes using a game engine to render the scenario using a three-dimensional terrain, with objects and information retrieved from geographic information systems. Additionally we describe experiments with new touch and tangible devices that support a war table like interaction with the simulation. We further describe our ideas for the emergency interface and conclude describing the directions for future work.
Correlation analysis on buyer-seller relationship in Malaysia: with reference to similarity and relationship in managerial and quality perspective
Authors: Khairul Anuar Mohd. Ali, Zainol Mustafa, Kamarulzaman Ibrahim, Azami Zaharim, Koh Mei Sin
Venue: Proceedings of the 1st WSEAS International Conference on Multivariate Analysis and its Application in Science and Engineering (2008)

Literature review reveals that there is a need for further research in the area of similarity-attraction paradigm impact on relationship management and relationship quality, especially from the perspective of purchasing professional and sales representatives. The population for this study comprised of all the purchasing personnel from the companies that are listed on the main and second board of Bursa Malaysia. 162 responses have been successfully collected. The reliability for the items and scales used in the questionnaire is 95.8%. By using correlation analysis from the SPSS program, the results have shown that there are significant relationship between the variables in Similarity and Relationship Management, and also between the variables in Similarity and Relationship Quality. Similarity in work attitudes has been found to have the most significant impact on relationship management and quality. Therefore, findings from this study is hoped to give contribution to knowledge especially in the role of Similarity in marketing relationships. Besides, this study will have some managerial implications, which will help management to determine an effective way of managing relationships and to improve the quality of the buyer-seller relationships.
A Mixed Data Clustering Algorithm to Identify Population Patterns of Cancer Mortality in Hijuelas-Chile
Authors: Eileen Malo, Rodrigo Salas, Mónica Catalán, Patricia López
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

The cancer disease in Hijuelas-Chile represents the 45% of the population deaths in the last decade. This high mortality rate have concerned the sanitary authority that lacks of information to identify the risk groups and the factors that influence in the disease.In this work we propose a clustering algorithm for mixed numerical, categorical and multi-valued attributes. We apply our proposed algorithm to identify and to characterize the common patterns in people who died of cancer in the population of Hijuelas between 1994 and 2006. As a consequence of this research, we were able to characterize the people who died of Cancer in Hijuelas-Chile.
A Microcomputer-Based Laboratory Aid for Visually Impaired Students
Authors: David Lunney, Robert Morrison, Margaret Cetera, Richard Hartness, Raymond Mills, Alger Salt, David Sowell
Venue: IEEE Micro (1983)

Built with high-performance industrial boards, this portable microcomputer functions both as a CP/M-based data acquisition and analysis system with voice output and as a talking scientific calculator.
Shape distinction for three-dimensional object retrieval
Authors: Philip Nathan Shilane
Venue:  (2008)

In recent years, there has been enormous growth in the number of 3D models and their availability to a wide segment of the population. Examples include the National Design Repository which stores 3D computer-aided design (CAD) models for tens of thousands of mechanical parts, the Protein Data Bank (PDB) that has atomic positions for tens of thousands of protein molecules, and the Princeton Shape Benchmark with thousands of everyday objects represented as polygonal surface models. With the availability of free interactive tools for creating 3D models and graphics cards for home computers, we can expect 3D data to become ever more widely available. Given the availability of 3D data, searching for a 3D object in a large database is a core problem for numerous applications including object recognition and the reuse of expertly created data. This raises two key research problems: (1) How can we improve search techniques? and (2) How do we evaluate 3D search techniques? The first contribution of this dissertation is an analysis technique to select the most important or distinctive regions of an object. Our approach identifies regions of a surface that have shape consistent with objects of the same type and different from objects of other types. By focusing a retrieval method on the most important regions of an object, we can improve retrieval performance in comparison to alternative feature point selection techniques. We investigate properties of shape distinction including techniques for calculating distinction, a method for visualizing differences in a database, and a prediction algorithm based on likelihoods of local shapes. We also demonstrate that shape distinction can be used in graphics applications such as mesh simplification and icon generation. The second contribution is a new methodology to analyze shape retrieval methods with a common data set of classified 3D models and software tools called the Princeton Shape Benchmark (PSB). Based on experiments with several different retrieval methods, we find that no single method is best for all classifications of objects, and thus the main contribution of the PSB is a framework to evaluate retrieval methods.
Parallel precision alignment of multiple micro components
Authors: Christian Brecher, Martin Weinzierl
Venue: Microsystem Technologies (2008)

Micro components are available in a variety of shapes sizing from 1 mm down to 0.01 mm. Today, their mass production is quite common using state of the art production technology. Micro spheres for example, are on the one hand available in lot sizes up to some thousands in a constant quality within micron accuracy. On the other hand they are quite commonly provided as bulk material with diameter variations of up to 10% in each lot size Brandau (Chem Ingenieur Tech 75:1741&#x2013;1745, 2003). In both cases, the bulk micro components are usually arranged in incoherent batches which are packed in plastic bags or small jars for handling and shipping. The decollating of the single components for follow-up micro assembly processes is complicated by the well-known effects in micro handling such as dominating adhesion and friction forces (Petersen 2003). These effects limit the post processing of bulk micro components to manual work in order to sort and align the single micro components prior to their exposure to an automated assembly line. To enable a sophisticated and automated handling of the single micro components, automated sorting and alignment mechanisms are necessary to arrange the bulk micro components in a well defined pattern structure which is essential to realize an efficient automated micro assembly.
Modeling objects using interest points, edges, and regions
Authors: Narendra Ahuja
Venue:  (2007)

This dissertation explores the application of different low level image features for the task of object category recognition and segmentation. In particular, it proposes novel fast and efficient models to represent object categories using interest points, edges, and regions. For interest points, a part based generate object template is proposed, which models object categories as a joint occurrence of appearance and location of texture patches around interest points. The model makes novel independence assumptions and proposes variational learning techniques which make learning and inference faster. The model is shown to have good detection and localization performance on standard datasets. This template model is enhanced for automatic object segmentation by incorporating image edge information. A model edge response which encodes the position of object edges with respect to the template is learned from image edges. Object segmentation is obtained by integrating the edge and interest point cues in a random field model. Towards object representation using regions, this thesis first presents a multiscale image segmentation algorithm which represents the image as a hierarchical tree of regions, i.e., a segmentation tree. The algorithm models edges between regions as rapidly varying ramp discontinuities, for which parameters are estimated and used to obtain the final segmentation. The thesis then proposes a model that represents object categories in terms of individual regions and their arrangement in the above segmentation tree. The performance of the model is tested with respect to its localization and segmentation accuracy on standard datasets.
A Pattern Language Verifier for Web-Based Enterprise Applications
Authors: Bahman Zamani, Sahar Kayhani, Greg Butler
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

The Pattern Language Verifier (PLV) is a process for verifying the application of a pattern language in a design. The PLV process focuses on a pattern language for the design of web-based enterprise applications. We show how PLV exploits the ideas of programming language compilers to detect the structural, syntactic, and semantic errors in a design model and then guides the designer in fixing the problems. To provide tool support, we integrate PLV into the ArgoUML modeling tool. We use the tool to design a simple student registration system as a case study, and show how the process finds the mistakes in the model and helps the designer in repairing the detected problems.
Application of Back-Propagation Neural Network to Power Transformer Insulation Diagnosis
Authors: Po-Hung Chen, Hung-Cheng Chen
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

This paper presents a novel approach based on the back-propagation neural network (BPNN) for the insulation diagnosis of power transformers. Four epoxy-resin power transformers with typical insulation defects are purposely made by a manufacturer. These transformers are used as the experimental models of partial discharge (PD) examination. Then, a precious PD detector is used to measure the 3-D (¿-Q-N) PD signals of these four experimental models in a shielded laboratory. This work has established a database containing 160 sets of 3-D PD patterns. The database is used as the training data to train a BPNN. The training-accomplished neural network can be a good diagnosis system for the practical insulation diagnosis of epoxy-resin power transformers. The proposed BPNN approach is successfully applied to practical power transformers field experiments. Experimental results indicate the attractive properties of the BPNN approach, namely, a high recognition rate and good noise elimination ability.
A Fair Mechanism for Recurrent Multi-unit Auctions
Authors: Javier Murillo, Víctor Muñoz, Beatriz López, Dídac Busquets
Venue: Proceedings of the 6th German conference on Multiagent System Technologies (2008)

Auctions are a good tool for dealing with resource allocation in multi-agent environments. When the resources are either renewable or perishable, a repeated auction mechanism is needed, in what is known as recurrent auctions. However, several problems arise with this kind of auction, namely, the resource waste problem, the bidder drop problem, and the asymmetric balance of negotiation power. In this paper we present different mechanisms to deal with these issues. We have evaluated the mechanisms in a network bandwidth allocation scenario, and the results show that the proposed mechanisms achieve higher benefits for the auctioneer, while also providing a fairer behavior.
Handling interdependent values in an auction mechanism for bandwidth allocation in tactical data networks
Authors: Mark Klein, Gabriel A. Moreno, David C. Parkes, Daniel Plakosh, Sven Seuken, Kurt Wallnau
Venue: Proceedings of the 3rd international workshop on Economics of networked systems (2008)

We consider a tactical data network with limited bandwidth, in which each agent is tracking objects and may have value for receiving data from other agents. The agents are self-interested and would prefer to receive data than share data. Each agent has private information about the quality of its data and can misreport this quality and degrade or otherwise decline to share its data. The problem is one of interdependent value mechanism design because the value to one agent for the broadcast of data on an object depends on the quality of the data, which is privately known to the sender. A recent two-stage mechanism due to Mezzetti (2004) can be modified to our setting. Our mechanism achieves efficient bandwidth allocation and provides incentive compatibility by conditioning payments on the realized value for data shared between agents.
Dynamic Data Probes
Authors: David W. Pearson
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

In this paper we look at a dynamic method for analysing data, called a data probe. The probe flies through the data space and is affected by the proximity and number of data points. The trajectory followed by the probe provides information about how the data are organised geometrically. We apply a state feedback method to the probe equations to make the probe search out certain data values.
Immediate Elaborated Feedback Personalization in Online Assessment
Authors: Ekaterina Vasilyeva, Paul Bra, Mykola Pechenizkiy
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

Providing a student with feedback that is timely, most suitable and useful for her personality and the performed task is a challenging problem of online assessment within Web-based Learning Systems (WBLSs). In our recent work we suggested a general approach of feedback adaptation in WBLS and through a series of experiments we demonstrated the possibilities of tailoring the feedback that is presented to a student as a result of her response to questions of an online test, taking into account the individual learning styles (LS), certitude in a response and correctness of this response. In this paper we present the result of the most recent experimental field study where we tested two feedback adaptation strategies in real student assessment settings (73 students had to answer 15 multiple-choice questions for passing the midterm exam). The first strategy is based on the correctness and certitude of the response, while the second strategy takes student LS into account as well. The analysis of assessment results and students' behaviour demonstrate that both strategies perform reasonably well, yet the analysis also provide some evidence that the second strategy does a better job.
Implementation of Neural Network Learning with Minimum L1-Norm Criteria in Fractional Order Non-gaussian Impulsive Noise Environments
Authors: Daifeng Zha
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Minimum L 1-norm optimization model has found extensive applications in linear parameter estimations. L 1-norm model is robust in non Gaussian alpha stable distribution error or noise environments, especially for signals that contain sharp transitions (such as biomedical signals with spiky series) or dynamic processes. However, its implementation is more difficult due to discontinuous derivatives, especially compared with the least-squares (L 2-norm) model. In this paper, a new neural network for solving L 1-norm optimization problems is presented. It has been proved that this neural network is able to converge to the exact solution to a given problem. Implementation of L 1-norm optimization model is presented, where a new neural network is constructed and its performance is evaluated theoretically and experimentally.
Microcode Optimization: Examples and Approaches
Authors: S. R. Vegdahl
Venue: IEEE Software (1986)

Firmware engineering strategies range from hand coding to the use of optimizing compilers. For fine-tuned microcode we often need the advantages of both ends of the spectrum.
Memory Allocation Tracing with VampirTrace
Authors: Matthias Jurenz, Ronny Brendel, Andreas Knüpfer, Matthias Müller, Wolfgang E. Nagel
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

The paper presents methods for instrumentation and measurement of applications' memory allocation behavior over time. It provides some background about possible performance problems related to memory allocation as well as to memory allocator libraries. Then, different methods for data acquisition and representation are discussed. Finally, memory allocation tracing integrated in VampirTrace is demonstrated with a real-world HPC example application from aerodynamical simulation and optimization.
Computer Graphics: The Next 20 Years
Authors: Ware Myers
Venue: IEEE Computer Graphics and Applications (1985)

Industry spokesmen speculate on the future computer graphics market, talk about financing, predict changes in CAD/CAM, and propose possible new products.
Topological Neighborhoods for Spline Curves: Practice & Theory
Authors: Lance Edward Miller, Edward L. Moore, Thomas J. Peters, Alexander Russell
Venue: Reliable Implementation of Real Number Algorithms: Theory and Practice: International Seminar Dagstuhl Castle, Germany, January 8-13, 2006 Revised Papers (2008)

The unresolved subtleties of floating point computations in geometric modeling become considerably more difficult in animations and scientific visualizations. Some emerging solutions based upon topological considerations for curves will be presented. A novel geometric seeding algorithm for Newton's method was used in experiments to determine feasible support for these visualization applications.
Curricular resources from the ACM two-year college education committee
Authors: Elizabeth K. Hawthorne, Robert D. Campbell, Karl J. Klee, Anita M. Wright
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

This poster presentation showcases curricular resources available from the Two-Year College Education Committee (TYCEC), a standing committee of the ACM Education Board since 1991. The primary charge of the Committee is to provide curriculum recommendations in all areas of computing for institutions that grant associate degrees. To this end, the TYCEC has published curriculum guidelines in each of the computing sub-disciplines: Information Technology, Computer Science, Information Systems, Computer Engineering and Software Engineering. With financial assistance from ACM and the National Science Foundation, the Committee has also conducted several workshops that targeted specific groups of two-year college faculty.
A Trusted Computing Model Based on Code Authorization
Authors: Guoheng Wei, Xueguang Zhou, Huanguo Zhang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

The capabilities trusted computing provides have the potential to radically improve the security and robustness of present systems. By combining present models for trusted computing with the thought of code authorization, we put forward a code authorization based Operation System model for Trusted Computing. This model solves the foundation security problems in the primitive model by creating a trusted chain from a core root of trust to all the Virtual Security Units (VSUs). The Trusted Platform Module (TPM) provides various security services, such as integrity checking and sealed storage, for all the VSUs and Authorization Describing Tables (ADTs). Moreover, the robustness of standard part in NGSCB is enforced for the security protection from the code authorization. This idea of code authorization can also be applied to most of present models that adopt the idea of box partition for trusted computing and improve their security to some extent.
Minimizing a stochastic maximum-reliability path
Authors: Feng Pan, David P. Morton
Venue: Networks (2008)

We consider a stochastic network interdiction problem in which the goal is to detect an evader, who selects a maximum-reliability path. Subject to a resource constraint, the interdictor installs sensors on a subset of the network's arcs to minimize the value of the evader's maximum-reliability path, i.e., to maximize the detection probability. When this decision is made, the evader's origin&ndash;destination pair is known to the interdictor only through a probability distribution. Our model is framed as a stochastic mixed-integer program and solved by an enhanced L-shaped decomposition method. Our primary enhancement is via a valid inequality, which we call a step inequality. In earlier work [Morton et al., IIE Trans 39 (2007), 3&ndash;14], we developed step inequalities for the special case in which the evader encounters at most one sensor on an origin&ndash;destination path. Here, we generalize the step inequality to the case where the evader encounters multiple sensors. In this more general setting, the step inequality is tightly coupled to the decomposition scheme. An efficient separation algorithm identifies violated step inequalities and strengthens the linear programming relaxation of the L-shaped method's master program. We apply this solution procedure with further computational enhancements to a collection of test problems. &copy; 2008 Wiley Periodicals, Inc. NETWORKS, 2008
Video Mosaics for Virtual Environments
Authors: Richard Szeliski
Venue: IEEE Computer Graphics and Applications (1996)

This article presents automated techniques for creating large, high-resolution images and environment maps from regular low-resolution video and photographic imagery. By panning a camera over a scene and automatically compositing the resulting frames, this system can create images and panoramas of arbitrary shape and detail. Translating the camera causes motion parallax in the video, which can be exploited to recover depth maps of the scene and thereby enable limited 3D rendering through view interpolation. The article discusses applications of these techniques to the creation of novel virtual environments and experiences such as virtual travel, home walkthroughs, and home supermarket shopping.