ppxscal/embedding_network huggingface dataset:
Backup and recovery in the IBM information network
Authors: K. Bhadra, S. M. Schiffman
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

The IBM Information Network is a nationwide system network architecture (SNA) network that provides users access to application offerings and network services. This paper describes the design of backup and recovery methods for insuring that the availability of the network is maintained. The communication management configuration (CMC) is highlighted and the uses of current SNA capabilities to provide dynamic switching are shown. In addition, operational and human factors in achieving and managing backup are described.
Rotation and intensity invariant shoeprint matching using Gabor transform with application to forensic science
Authors: Pradeep M. Patil, Jayant V. Kulkarni
Venue: Pattern Recognition (2009)

Shoe marks at the place of crime provide valuable forensic evidence. This paper presents a technique for rotation and intensity invariant automatic shoeprint matching. Multiresolution features of a shoeprint have been extracted using Gabor transform. Rotation of the shoeprint image has been estimated using Radon transform and is compensated by rotating the features in opposite direction. The performance of the proposed algorithm has been compared with the technique in which the features have been determined using Fourier transform and its power spectral density. Shoeprint database has been generated by inviting participants to tread on an inkpad and then stamp on a piece of paper. Euclidian distance classifier has been used to find a suitable match. The performance of the proposed algorithm has been evaluated in terms of correct recognition rate computed using best match score at rank '1' and cumulative match score for the first four matches with rotation, intensity and/or mixed attacks. A good matching performance has been achieved with rotation attack; typically 91 percent at rank '1' and 100 percent at rank '2' for full prints. Performance of the proposed technique is better even for partial shoeprints. Experimentation has also been carried out by perturbing shoeprint images with Gaussian white noise, salt and pepper noise to evaluate the robustness of the proposed technique.
Integration of IT strategy and enterprise architecture models
Authors: Ivaylo Velitchkov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The paper provides the rationale and concept for integration of models and modeling objects of Enterprise Architecture and IT Strategies. The cohesion between and within Business and IT is achieved by means of services. Among other applications this concept justifies inclusion of Enterprise Architecture as perspective in Balanced Scorecards used for IT Strategy management and measurement. Then the relations between BSC objects and EA objects can be maintained in a single modeling repository thus providing an integrated environment for methods, processes, models and variants of objects and enabling holistic strategy, project and architecture management.
Yours, mine and (not) ours: social influences on group information repositories
Authors: Emilee Rader
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Group information repositories are systems for storing and organizing files in a central location all group members can access. The functionality and capabilities of these systems are essentially the same as the desktop metaphor of personal information management (PIM) systems. Using a case study of a group information repository, I argue that social factors affect the information structure of the repository, and how it grows and evolves over time. Users restrict their activities to files they own, are reluctant to delete files that might be useful to others, dislike the clutter that results, and can become demotivated if no one views files they uploaded.
AHLSS: A Hierarchical, Adaptive, Extendable P2P Live Streaming System
Authors: Runzhi Li, Chunyi Guo, Ming Fan, Zongmin Wang
Venue: International Journal of Distributed Sensor Networks (2009)

With the development of P2P streaming technology, various live streaming systems have been designed. Some measurement studies recently have shown that the most important issue exposed by previous systems is how to balance the benefits between the internet service provider, the internet content provider, and P2P users. This issue is induced by little consideration on management and control. Other problems include how to resolve peers churn and make full use of network bandwidth and apply incentive mechanism among peers. In this work we introduce AHLSS, a P2P system for live streaming which is hierarchical, adaptive, and extendable. We present the architecture of AHLSS which is divided into three layers. The top layer named AP (Administrator Peer) overlay consisted of some authentic servers, which are arranged by ICP (Internet Content Provider) to provide enrollment and authentication for peers to join P2P overlay and start to watch a media channel. Every AP locates in an alliance alone. The middle layer is SP overlay. AHLSS divides peers that participate in data transmission into two classes, including SP and NP, which base on the capability of peers. SP is elected by AP. SP has responsibility to route media packets quickly and reply peers' channel request within the cluster. The under layer consists of many clusters. A cluster is formed by uniting peers which have poor capability and little stability near SP. SP is named cluster-head with the responsibility for management of members in the cluster. Our system's innovative features are the following: It provides the function of enrollment and authentication; AP look up peer's EnrollInfo (a list, which keeps the register information of peers) periodically and apply a decision-tree approach to elect SP. It resolves problems which are associated with the dynamics and heterogeneity of peers; to cope with the problem of topology-mismatch, we design Alliance and Cluster to partition the physical location of peers and make use of the Two-hop Detection Algorithm which belongs to LTM technology to optimize the connection of SP among alliances; different transmission modes are designed on SP overlay and within cluster. Native mesh-pull is adopted in SP overlay and the hybrid mode includes tree-push and mesh-pull which are applied in NP (Normal Peer) overlay. It reduces the delay in chunks transmitted through SP to NP and makes full use of the upload bandwidth of peers; Approach of K degree redundancy cluster-head is adopted by NP, it is used to avoid the inorganized status for NPs which resulted from SP's failure. In this paper, we describe in detail the main algorithms that stand behind the design of AHLSS and present the analysis of architecture for various aspects including adaptability, scalability, efficiency, and robustness.
Maximizing the number of dual-cycle operations of quay cranes in container terminals
Authors: Haipeng Zhang, Kap Hwan Kim
Venue: Computers and Industrial Engineering (2009)

An important objective of all schedules in a port is to minimize turnaround time of vessels. An operation schedule for Quay Cranes (QCs) can significantly affect the turnaround time of a vessel. Recently dual cycling techniques have already been used for reducing the number of operation cycles of QCs in some advanced container terminals. This study attempts to minimize the number of operation cycles of a QC for discharging and loading containers in a ship-bay, which is equivalent to maximizing the number of dual cycle operations. A formulation in QC scheduling problems is proposed as a mixed integer programming model. A hybrid heuristic approach is proposed to solve this model. The algorithm applied in this study takes two types of sequencing into account, i.e. inter-stage sequencing (hatch sequencing) and intra-stage sequencing (stack sequencing in the same hatch). This approach hybridizes a certain reconstructive Johnson's rule with an effective local search method. Finally, certain data in real cases are used to evaluate the effectiveness of the proposed approach.
A simulation model for intensive piglet production systems
Authors: Lluís M. Plà-Aragonès, Virginia Flores Marias, Sara V. Rodríguez-Sánchez
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

A simulation model representing the dynamics of a sow farm is presented in contrast with other approaches. To highlight relevant aspects of the model a real application for planning piglet production is considered. The main contribution of the model is that sow herd management is based on batches of sows being in the same reproductive state, as actually is done in practice. This features allow to measure the discrepancy with other approaches and comparing different reproductive management strategies in a more realistic way than by using other quantitative methods. Furthermore, the implementation in Extend allows potential users to perform efficiently different kinds of analyses tracking variables of their own interest.
Automated execution of simulation studies demonstrated via a simulation of a car
Authors: Sven Dominka, Eduard Broecker, Frank Schiller
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In the automotive area, a huge number of different technologies were developed in the last couples of years. The car manufacturers have to meet the challenge of selecting the most suitable components for their purpose. One way of doing so is to evaluate these components by the help of a car simulation model. Because of the huge number of different technologies, also a lot of simulation models are needed to be able to compare all of those innovative technologies. In this paper, a system is described, with which it is possible to automatically generate simulation models. This system is used to generate varied simulation models which represent different car configurations. After the generation of a model for each car configuration, a parameter optimization is automatically executed. The result is a chosen car simulation model with its set of parameters, which presents an optimal solution for the regarded aim, e.g. efficiency.
Application of Modified Genetic Algorithm in Feature Extraction of the Unstructured Data
Authors: Nan Du, Hong Peng, Wenfeng Zhang
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Since unstructured data’s quantity is huge and the form is not disunity, thus the extent mining algorithms are hard to mine them. This paper supposes a modified genetic algorithm which extracts the feature from the unstructured data in a high efficiency and makes the further mining conveniently. First of all, it discusses the characteristic of the unstructured data, and then introduces the preprocess of it such as word segmentation, establishing the stop words table and feature extraction. Furthermore, the modified genetic algorithm’s operation such as selection、crossover as well as mutation is presented. Finally, the test of result of this modified genetic algorithm is shown, and the test result has proven that the algorithm is effective.
Decision support system for service quality management using customer knowledge in public service organization
Authors: Chong Un Pyon, Min Jung Lee, Sang Chan Park
Venue: Expert Systems with Applications: An International Journal (2009)

As the service quality has been reconsidered in the public sector as well as private enterprises, the need for public sectors to adopt principle and practices of private sectors is concerned with customer-focused approach. However, the different business culture of public service organizations makes it difficult to improve service quality. It is required to establish a structured framework that leads employees to make efforts to improve their service delivery processes and supports continuous improvement of service delivery processes based on the data about the process performance from the customer-perceived value-oriented viewpoint. In this paper, we propose a structured framework that identifies the key service processes, validates from customer perspectives and establishes the measurements to monitor based on the data about the process performance. It uses periodic customer satisfaction index (CSI) surveys (S.C. Park) for understanding customer-perceived values. The proposed framework consists of three phases; the questionnaire design, the key process (KP) identification from the integrated viewpoints of importance and contribution, and the key process indicator (KPI) derivation and management. For the application, we established a web-based decision support system for a public service organization for tourism in Korea.
Data farming in Singapore: a brief history
Authors: C. S. Choo, E. C. Ng, Dave Ang, C. L. Chua
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper gives a summary of Singapore's involvement in Data Farming since 2002, tracing the country's progression from basically "zero" to a key partner in the International Data Farming community. It highlights how the Data Farming methodology, coupled with efficient experiment designs, visualization concepts, and evolutionary algorithms, has helped to extend the analytical capability of conducting studies and experiments. The paper also described some past and current Research and Development (R&D) projects inspired by the ideas shared among this highly interactive and dynamic international community. These include Systematic Data Farming (SDF), Automated Red Teaming (ART), Automated Co-Evolution (ACE), and modeling the effects of human intangibles. Last but not least, the way forward for Singapore in Data Farming is discussed.
Adaptive CUSUM control chart with variable sampling intervals
Authors: Yunzhao Luo, Zhonghua Li, Zhaojun Wang
Venue: Computational Statistics Data Analysis (2009)

The standard cumulative sum chart (CUSUM) is widely used for detecting small and moderate process mean shifts, and its optimal detection ability for any pre-specified mean shift has been demonstrated by its equivalence to continuous sequential tests. In real practice, the assumption of knowing the true mean shift in prior cannot be always met. So it is desirable to design a procedure that is efficient for detecting a range of future expected but unknown mean shifts. Adaptive CUSUM control chart, which can continuously adjust itself by a one-step forecasting operator, has been proposed to detect efficiently and robustly for a range of mean shifts in the early literature. Moreover, in terms of sampling time to signal, control chart with the VSI (variable sampling intervals) feature can detect the process changes more quickly than the traditional FSI (fixed sample intervals) chart. In this paper, a new CUSUM control chart which is based on both adaptive and VSI features is discussed. Also, a two-dimensional Markov chain model is developed to evaluate its run-time performance.
Two mathematical gestalts for computer theory
Authors: Kirby McMaster, Brian Rague, Steven Hadfield
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

Many Computer Science educators have campaigned to increase mathematical content in the computing curriculum. However, mathematical concepts are often presented in a manner that conflicts with the general mental framework, or gestalt, of CS students. Fortunately, there is more than one gestalt in mathematics. In previous research, we developed two scales for measuring mathematical gestalt in books-a Logical Math scale and a Computational Math scale. In this paper, we apply our two scales to current Computer Theory books to assess the relative emphasis these books give to each gestalt. Our findings have relevance in the development of approaches for teaching mathematical topics in computer courses, especially Computer Theory courses.
A general distributed scalable grid scheduler for independent tasks
Authors: Cong Liu, Sanjeev Baskiyar
Venue: Journal of Parallel and Distributed Computing (2009)

We consider non-preemptively scheduling a bag of independent mixed tasks (hard, firm and soft) in computational grids. Based upon task type, we construct a novel generalized distributed scheduler (GDS) for scheduling tasks with different priorities and deadlines. GDS is scalable and does not require knowledge of the global state of the system. It is composed of several phases: a multiple attribute ranking phase, a shuffling phase, and a task-resource matched peer to peer dispatching phase. Results of exhaustive simulation demonstrate that with respect to the number of high-priority tasks meeting deadlines, GDS outperforms existing approaches by 10%-25% without degrading schedulability of other tasks. Indeed, with respect to the total number of schedulable tasks meeting deadlines, GDS is slightly better. Thus, GDS not only maximizes the number of mission-critical tasks meeting deadlines, but it does so without degrading the overall performance. The results have been further confirmed by examining each component phase of GDS. Given that fully known global information is time intensive to obtain, the performance of GDS is significant. GDS is highly scalable both in terms of processors and number of tasks-indeed it provides superior performance over existing algorithms as the number of tasks increase. Also, GDS incorporates a shuffle phase that moves hard tasks ahead improving their temporal fault tolerance. Furthermore, since GDS can handle mixed task types, it paves the way to open the grid to make it amenable for commercialization. The complexity of GDS is O(n^2m) where n is the number of tasks and m the number of machines.
Digital Safari Guidebook with Image Retrieval
Authors: Toshiyuki Iwaoka, Hideyuki Kobayashi, Shunji Ota
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Digital Safari Guidebook will make it easy to file or search multimedia databases for educational and entertainment purposes. When a user takes a picture of an animal with a digital camera connected to the computer, similar images in the animal database will be retrieved simulating human preferences. The digital guidebook will then show information about the animal. This is a pursuit for the development of a new application with our KANSEI (feeling, impression or sensibility in Japanese) Image Retrieval technology which uses color and shape features of captured images. Our system extracts KANSEI features from each image, and sets adequate weights for combining those features. In the combining procedure, we introduce a new value called "adaptability". It judges how much of the features are extracted from the image. As a result, adaptability makes it possible to make a KANSEI model depending on each image and to calculate similarity between images.
Bus mastering PCI express in an FPGA
Authors: Ray Bittner
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

This paper describes a bus mastering implementation of the PCI Express protocol using a Xilinx FPGA. While the theoretical peak performance of PCI Express is quite high, attaining that performance is a complex endeavor on top of an already complex protocol. The implementation is described and its performance is analyzed. Source code is offered for free download via the web.
Local Image Features Resulting from 3-Dimensional Geometric Features, Illumination, and Movement: I
Authors: James Damon, Peter Giblin, Gareth Haslinger
Venue: International Journal of Computer Vision (2009)

We study images of smooth or piecewise smooth objects illuminated by a single light source, with only background illumination from other sources. The objects may have geometric features (F), namely surface markings, boundary edges, creases and corners; and shade features (S), namely shade curves and cast shadow curves. We determine the local stable interactions between these and apparent contours (C) for the various configurations of F, S, C, and we concisely summarize them using an "alphabet" of local curve configurations. We further determine the generic transitions for the configurations resulting from viewer movement. These classifications are obtained using the methods of singularity theory, which allows us to ensure that our lists are complete, in some cases correcting earlier attempts at similar classifications.
Addressing thermal and power delivery bottlenecks in 3D circuits
Authors: Sachin S. Sapatnekar
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

The enhanced packing densities facilitated by 3D integrated circuit technology also has an unwanted side-effect, in the form of increasing the amount of current per unit footprint of the chip, as compared to a 2D design. This has ramifications on two critical issues: firstly, it means that more heat is generated per unit footprint, potentially leading to thermal problems, and secondly, more current must be supplied per package pin, leading to possible power delivery bottlenecks. This paper presents an overview of the challenges and solutions in the domain of addressing these two issues in 3D integrated circuits.
LINQ for VB 2005, New edition
Authors: Fabio Claudio Ferracchiati
Venue:  (2007)

Are you ready for the future of data access in .NET? At the Microsoft Professional Developers Conference (PDC) 2005, Microsoft previewed a new technology, Language-Integrated Query (LINQ). It captured a lot of attention because it addressed the fundamental issue of merging object-oriented applications with relational data. The LINQ Project team demonstrated how to use LINQ to query a variety of data sources, such as a SQL Server database, an XML file, and an array, and how to manage the data using an object-oriented approach. Fabio Ferracchiati has written a comprehensive guide to the three main parts of the LINQ May 2006 CTP: managing in-memory data (LINQ to Objects), accessing relational databases (LINQ to ADO .NET), and manipulating XML documents (LINQ to XML). Each chapter offers many practical examples that you can try yourself with the downloadable source code. Youll quickly learn everything you want and need to know about LINQ by actually using LINQ. The future of .NET data access is already hereand its a very bright one!
Generalized Program Slicing Applied to Z Specifications
Authors: Fangjun Wu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Program slicing, a well-known technique, originally introduced by Weiser M., has already been widely used in numerous software engineering areas. With the development of research, the concept of program slicing is extended, and its application domains are broadened. This paper proposes a method for slicing Z formal specifications based on relations selection, relations projection and relations connection. This method does not take any time to construct dependence graphs, which decreases chance of making a mistake. Finally, it is applied to automate theorem proof, one of main artificial intelligence activities. 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