ppxscal/embedding_network huggingface dataset:
Advanced Supply Chain Protection & Integrated Decision Support System
Authors: Francesco Longo, Marina Massei
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This research is looking forward for developing innovative tools for analysis and optimization of risk related to evolution of Small & Medium Enterprises(SMEs) respect to supply chain management issues. In fact, SMEs require decision supports in order to keep under control the dynamic evolution of the supply chain. In the last years, the globalization as well as the quick changes in world situation pushed to outsource operations and activities, therefore this direction requires to be evaluated in term of risks. The authors propose to use modelling for evaluating the impact on the supply chain of different aspects such as international competition, know-how diffusion in new areas, critical events and disasters. These factors, in addition the effect on the single supply chain vulnerability, generate interactions that can result even more critical. The authors are looking forward to develop also a metrics to be estimated by simulation models in order to compare different scenarios in supply chain management.
Modeling and analysis of regional registration based mobile multicast service management
Authors: Ing-Ray Chen, Ding-Chau Wang
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

We propose and analyze a regional registration based mobile multicast service management scheme which we call URRMoM for efficiently supporting mobile multicast in Mobile IP networks. URRMoM extends the design concept of Remote Subscription (RS) by using mobile multicast agents (MMAs), each covering a number of MHs in its service area through tunneling multicast packets received from the multicast source to them. URRMoM adopts a user-central design allowing each mobile host to determine its optimal MMA service area dynamically depending on its service and mobility characteristics. We develop an analytical model to describe the behavior of a MH operating under URRMoM and derive the optimal service area of the MMA based on the MH&#x2019;s service and mobility characteristics to minimize the total network traffic generated due to multicast packet delivery and multicast tree maintenance. We demonstrate the benefit of our proposed regional registration based mobile multicast service management scheme over existing schemes including RS and RBMoM.
ECHoP2P: Emergency call handling over peer-to-peer overlays
Authors: Kalman Graffi, Aleksandra Kovacevic, Kyra Wulffert, Ralf Steinmetz
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

The impact of the peer-to-peer paradigm increases both in research and in industry. Still, serious applications for P2P-based systems are rare. On the other hand, Emergency Call Handling (ECH) is (or will be) a mandatory function for VoIP services. In this paper we investigate international legal and technical requirements of ECH and present ECHoP2P, a solution that fulfills these requirements. Based on Globase.KOM and HiPNOS.KOM, ECHoP2P provides the functionality to determine the closest and (geographically) responsible Emergency Station to a calling peer. Further, Emergency Calls are processed with highest priority in the overlay, so that quality of service guarantees are given. We evaluated ECHoP2P thoroughly and present the quality and costs analysis, identified tradeoffs and effects of optimization parameters. ECHoP2P provides a fully evaluated solution for Emergency Call Handling and for further location-aware applications.
Electron beam size determination based on an intelligent substrate
Authors: Helmut Weigand, Monika Fleischer, Dieter P. Kern
Venue: Microelectronic Engineering (2008)

In this work we perform a feasibility study of electron beam size determination based on the measurement of the beam current using a structured substrate, which is moved via a stage underneath the beam. This method is suitable for low energy electrons and does not require beam movement or the knowledge of exact lateral beam or substrate positions to obtain the beam size. In addition, the device can be extended to acquire beam shape information.
Challenging benchmark for location discovery in ad hoc networks: foundations and applications
Authors: Davood Shamsi, Farinaz Koushanfar, Miodrag Potkonjak
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

We have created the first comprehensive and challenging benchmark data set for the ad-hoc location discovery (LD). The benchmark is a collection of representative real-life distance measurement data that establishes a common basis for understanding, characterization, evaluation and comparison of the LD algorithms and solvers. It is constructed using a novel analysis methodology that systematically establishes the difficulty of discovering the locations. Presence of measurement noise renders the problem difficult even in dense networks. The noise impacts the continuous optimization underlying the LD calculations. We focus on the difficulty of node localization in dense networks. In such networks, the location calculation is viewed as a continuous optimization problem instance with an objective function and a set of constraints. We devise a number of new metrics that evaluate the difficulty of the continuous optimization based on the data set properties. For the LD optimization, a fast simulation methodology is devised for rapid analysis of the sensitivity of the goodness with respect to the data set properties. We present a number of applications for the benchmark data and use it for evaluation and comparison of six popular LD algorithms. The LD benchmarks are publicly available at: http://www.ece.rice.edu/~mm7/benchLD/.
Study on the vacuum breakdown in field emission of a nest array of multi-walled carbon nanotube/silicon nanoporous pillar array
Authors: Wei Fen Jiang, Long Yu Li, Shun Hua Xiao, Yong Fen Dong, Xin Jian Li
Venue: Microelectronics Journal (2008)

A composite structure, a nest array of multi-walled carbon nanotubes/silicon nanoporous pillar array (NACNT/Si-NPA), with good field emission properties, was synthesized through growing CNT on Si-NPA by thermal chemical vapor deposition. In order to make full use of its good field emission properties, the vacuum breakdown behavior accompanied with field emission from NACNT/Si-NPA was investigated. The results revealed that a positive feedback of field emission and resulted Joule heat ignited a small portion of protruding emitters, which caused spark discharge, destroyed the anode and generated a large amount of heat. The thermal runaway ultimately resulted in the destruction of substrate and vacuum breakdown.
Analytics-driven solutions for customer targeting and sales-force allocation
Authors: R. Lawrence, C. Perlich, S. Rosset, J. Arroyo, M. Callahan, J. M. Collins, A. Ershov, S. Feinzig, I. Khabibrakhmanov, S. Mahatma, M. Niemaszyk, S. M. Weiss
Venue: IBM Systems Journal (2007)

Sales professionals need to identify new sales prospects, and sales executives need to deploy the sales force against the sales accounts with the best potential for future revenue. We describe two analytics-based solutions developed within IBM to address these related issues. The Web-based tool OnTARGET provides a set of analytical models to identify new sales opportunities at existing client accounts and noncustomer companies. The models estimate the probability of purchase at the product-brand level. They use training examples drawn from historical transactions and extract explanatory features from transactional data joined with company firmographic data (e.g., revenue and number of employees). The second initiative, the Market Alignment Program, supports sales-force allocation based on field-validated analytical estimates of future revenue opportunity in each operational market segment. Revenue opportunity estimates are generated by defining the opportunity as a high percentile of a conditional distribution of the customer's spending, that is, what we could realistically hope to sell to this customer. We describe the development of both sets of analytical models, the underlying data models, and the Web sites used to deliver the overall solution. We conclude with a discussion of the business impact of both initiatives.
Autonomous driving in urban environments: Boss and the Urban Challenge
Authors: Chris Urmson, Joshua Anhalt, Drew Bagnell, Christopher Baker, Robert Bittner, M. N. Clark, John Dolan, Dave Duggins, Tugrul Galatali, Chris Geyer, Michele Gittleman, Sam Harbaugh, Martial Hebert, Thomas M. Howard, Sascha Kolski, Alonzo Kelly, Maxim Likhachev, Matt McNaughton, Nick Miller, Kevin Peterson, Brian Pilnick, Raj Rajkumar, Paul Rybski, Bryan Salesky, Young-Woo Seo, Sanjiv Singh, Jarrod Snider, Anthony Stentz, William “Red” Whittaker, Ziv Wolkowicki, Jason Ziglar, Hong Bae, Thomas Brown, Daniel Demitrish, Bakhtiar Litkouhi, Jim Nickolaou, Varsha Sadekar, Wende Zhang, Joshua Struble, Michael Taylor, Michael Darms, Dave Ferguson
Venue: Journal of Field Robotics (2008)

Boss is an autonomous vehicle that uses on-board sensors (global positioning system, lasers, radars, and cameras) to track other vehicles, detect static obstacles, and localize itself relative to a road model. A three-layer planning system combines mission, behavioral, and motion planning to drive in urban environments. The mission planning layer considers which street to take to achieve a mission goal. The behavioral layer determines when to change lanes and precedence at intersections and performs error recovery maneuvers. The motion planning layer selects actions to avoid obstacles while making progress toward local goals. The system was developed from the ground up to address the requirements of the DARPA Urban Challenge using a spiral system development process with a heavy emphasis on regular, regressive system testing. During the National Qualification Event and the 85-km Urban Challenge Final Event, Boss demonstrated some of its capabilities, qualifying first and winning the challenge. &copy; 2008 Wiley Periodicals, Inc.
Considering operational issues for multiagent conceptual inferencing in a distributed information retrieval application
Authors: Leen-Kiat Soh
Venue: Web Intelligence and Agent Systems (2008)

Our system, based on a multiagent framework called collaborative understanding of distributed knowledge (CUDK), is designed with the overall goal of balancing agents' conceptual learning and task accomplishment. The tradeoff between the two is that while conceptual learning allows an agent to improve its own concept base, it could be counter-productive: conceptual learning is time consuming and requires processing resources necessary for the agent to accomplish its tasks. In our current phase of research, we investigate the roles of resource and knowledge constraints, environmental factors (such as the frequency of queries), and learning mechanisms in a CUDK-based distributed information retrieval (DIR) application. In this application, an agent is motivated to learn about its neighbors' concept base so it can collaborate to satisfy queries that it cannot satisfy alone. Similarly, to conserve resources, an agent is motivated not to learn from neighbors that have been unhelpful in the past. As a result, it is possible for an agent to learn from a helpful neighbor that is not the authoritative expert in the system. The agents use neighborhood profiling to learn about other agents' helpfulness and conceptual inferencing to learn about other agents' known concepts. The helpfulness measure defines a metric called collaboration utility, and the inferencing results are stored in a translation table in which each entry is a mapping between two concepts plus an associated credibility score. The experiments investigate how operational and conceptual factors impact the DIR application's performance.
Sociotechnical research and knowledge communication in community-centred systems design: a technological frames perspective
Authors: Jose Abdelnour-Nocera, Lynne Dunckley
Venue: International Journal of Web Based Communities (2008)

An application of the concept of technological frames is presented as a way to understand the co-configuration of people, culture and technology. It shows how technological frames can be used to solve the problems that arise when the producers of a system come from a very different cultural and technological environment from the intended users of the system. This concept is proposed as an analysis framework whose purpose is twofold: to be used in the evaluation of how the context and local culture shape the utility and usability of interactive systems, both in their development and also once they are deployed to their actual contexts of use and to understand the dynamics of technical and interpersonal communication in communities of practice. This is illustrated with a case study about the ongoing research in the participative development of Information and Communications Technology (ICT) artefacts for a wireless and web based knowledge based system for Kenyan farming communities.
Proponents Try to Rehabilitate Peer-to-Peer Technology
Authors: Sixto Ortiz Jr.
Venue: Computer (2008)

Proponents have undertaken a major effort to change P2P technology, rehabilitate the approach's reputation, and encourage its use for fast, efficient content distribution and improved Internet-based communications services.
Sorting by transpositions: dealing with length-weighted models
Authors: Xingqin Qi, Jichang Wu, Shuguang Li, Guojun Li
Venue: International Journal of Bioinformatics Research and Applications (2008)

For the first time, we study the sorting of permutations by length-weighted transpositions under a wide class of cost functions, namely f(l)=l&alpha;, where l is the length of the transposition. For different &alpha;, we give corresponding upper and lower bounds of the cost of sorting any binary sequences or any permutations. Furthermore, an O(log n) approximation algorithm and an exact algorithm are given to determine the optimal transposition series of sorting a permutation of length n when 1 < &alpha; < 2 and &alpha; &ge; 2 respectively. Our work poses some interesting questions to both biologists and computer scientists and suggests some new bioinformatic insights that are currently being studied.
Weak inequalities for Cesàro and Riesz summability of Walsh--Fourier series
Authors: Péter Simon, Ferenc Weisz
Venue: Journal of Approximation Theory (2008)

The maximal operators for Cesaro or (C,@a) and Riesz summability with respect to Walsh-Fourier series are investigated as mappings between dyadic Hardy and Lebesgue spaces. It is well known that they are bounded from H"p to L"p for all 1/(@a+1)
News Briefs
Authors: Brandi Ortega
Venue: IEEE Security and Privacy (2008)

A brief look at news items related to security and privacy.
On the changing face of service composition in telecom
Authors: Dipanjan Chakraborty, Sunil Goyal, Sumit Mittal, Sougata Mukherjea
Venue: Proceedings of the 2007 Workshop on Middleware for next-generation converged networks and applications (2007)

With the emergence of converged networks, Telecom operators are looking at composing Telecom functionality with 3rd party offerings to provide rich, innovative value-added services to their customers. In parallel, Internet Content providers like Google and Yahoo are rapidly moving towards adopting Web 2.0 technologies to enable a variety of end-user applications, and making them accessible to Telecom customers as well. This provides strong competition to similar paid-for services exposed on the Telecom portal. Telecom operators have recently started inspecting their service composition practises to see how it might be possible to exploit a Web 2.0 environment for rapid service creation. In this paper, we take a deeper look into service composition in a converged Web 2.0 Telecom ecosystem, consisting of Telecom functionality, 3rd party offerings and several categories of developers and users. We also propose a generic model for Telecom services in this ecosystem. Thereafter, we critically evaluate various existing service composition efforts for Telecom. Finally, we identify some open challenges and propose insights to address them.
Relative simulation and model checking of real-time processes
Authors: Colin Fidge
Venue: Proceedings of the thirty-first Australasian conference on Computer science - Volume 74 (2008)

Simulation and model checking are commonly used to compare the behaviour of a computer-based system with its requirements specification. However, when upgrading an operational legacy system the challenge is usually to compare the behaviour of a proposed new system against an old trusted one. Doing this for time-sensitive control systems is awkward because the behaviour of the system is dependent on that of its physical environment. Consequently, the old and new systems can be compared meaningfully only when they are simulated under exactly the same conditions. In this paper we show how this can be done by simulating both the old and new systems simultaneously, with both system models linked to the same environment model. The resulting simulation traces and model checking counterexamples allow the behaviours of a legacy real-time system and its proposed replacement to be compared directly and easily.
Mining High Utility Itemsets in Large High Dimensional Data
Authors: Guangzhu Yu, Keqing Li, Shihuang Shao
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Existing algorithms for utility mining are inadequate on datasets with high dimensions or long patterns. This paper proposes a hybrid method, which is composed of a row enumeration algorithm (i.e., Inter-transaction) and a column enumeration algorithm (i.e., Two-phase), to discover high utility itemsets from two directions: Two-phase seeks short high utility itemsets from the bottom, while Intertransaction seeks long high utility itemsets from the top. In addition, optimization technique is adopted to improve the performance of computing the intersection of transactions. Experiments on synthetic data show that the hybrid method achieves high performance in large high dimensional datasets.
Optimizing static calendar queues
Authors: K. B. Erickson, R. E. Ladner, A. LaMarca
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

The calendar queue is an important implementation of a priority queue which is particularly useful in discrete event simulators. In this paper we present an analysis of the static calendar queue which maintains N active events. A step of the discrete event simulator removes and processes the event with the smallest associated time and inserts a new event whose associated time is the time of the removed event plus a random increment with mean /spl mu/. We demonstrate that for the infinite bucket calendar queue the optimal bucket width is approximately /spl delta//sub opt/=/spl radic/(2b/c)/spl mu//N where b is the time to process an empty bucket and c the incremental time to process a list element. With bucket width chosen to be /spl delta//sub opt/, the expected time to process an event is approximately minimized at the constant c+/spl radic/(2bc)+d, where d is the fixed time to process an event. We show that choosing the number of buckets to be O(N) yields a calendar queue with performance equal to or almost equal to the performance of the infinite bucket calendar queue.
Introduction to Identity-Based Encryption (Information Security and Privacy Series), 1 edition
Authors: Luther Martin
Venue:  (2008)

If you're looking to fully understand and effectively implement identity-based encryption (IBE) technology, this authoritative resource is a smart choice. Until now, details on IBE have only been found in cumbersome, hard-to-follow journal articles and conference proceedings. This is the first book to offer you complete, easy-to-understand guidance on the subject. Comparing and contrasting IBE with traditional public-key technologies, the book clearly explains how and why IBE systems are secure. You find a wealth of practical techniques, algorithms and numerous worked examples that enable you to create a secure IBE system. From basic mathematical concepts and properties, properties of elliptic curves, divisors and the Tate pairing, and cryptography and computational complexity, to related cryptographic algorithms, various IBE schemes, hierarchical IBE and master secret planning, and calculating pairings, this comprehensive volume serves as a clear guide to this increasingly important security technology. This hands-on volume includes detailed pseudocode for
Pulmonary Tumor Volume Detection from Positron Emission Tomography Images
Authors: Aparna Kanakatte, Nallasamy Mani, Bala Srinivasan, Jayavardhana Gubbi
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Lung carcinoma is one of the most lethal of cancers worldwide. Positron emission tomography (PET) data has greater sensitivity and specificity in the staging of lung cancer than computed tomography (CT) or magnetic resonance imaging (MRI). Inaccurate detection of the tumor volume by the physicians is the largest source of error in the efficient planning of radiation treatment. In this paper we present an automated process of tumor delineation and volume detection from each frame of PET lung images. We have represented the data using spatial features (geometric moments) and frequency domain features (discrete cosine transform, wavelets). The performance of these features were analysed using k-nearest neighbor and support vector machines (SVM) classifiers. Wavelet features with SVM classifier gave a consistent accuracy of 97% with an average sensitivity and specificity of 0.81 and 0.99 respectively. The calculated volume from the delineated tumor by the proposed method matched the manually segmented volume by the physicians. This research will facilitate the physicians in accurate staging and radiotherapy treatment planning for lung tumors. It also eliminates the need for manual tumor segmentation thus reducing the physician fatigue to a great extent.
Human factors in software security risk management
Authors: Shareeful Islam, Wei Dong
Venue: Proceedings of the first international workshop on Leadership and management in software architecture (2008)

All kinds of human factors can deeply affect the results and efficiency of software risk management. This paper focuses on our ongoing work of studying human factors in security risk management. The human factors are identified and classified for the categories of individual, team, management and stakeholder, as well as for the activities of security risk identification, analysis and mitigation. Then some considerations and recommendations for mitigating these factors and risks are presented, and the generic framework of evolving them into the secure software architecture is also figured.