ppxscal/embedding_network huggingface dataset:
Entropy maximization and NT vacation M/G/1 model with a startup and unreliable server: comparative analysis on the first two moments of system size
Authors: Jau-Chuan Ke, Chuen-Horng Lin, Hsin-I Huang
Venue: International Journal of Computer Mathematics (2009)

We consider the control policy of an M/G/1 queueing system with a startup and unreliable server, in which the length of the vacation period is controlled either by the number of arrivals during the idle period, or by a timer. After all the customers have been served in the queue, the server immediately takes a vacation and operates an NT vacation policy: the server reactivates as soon as the number of arrivals in the queue reaches a predetermined threshold N or when the waiting time of the leading customer reaches T units. In such a variant vacation system, the steady-state probabilities cannot be obtained explicitly. Thus, the maximum entropy principle is used to derive the approximate formulas for the steady-state probability distributions of the queue length. A comparitive analysis of two approximation approaches, using the first and the second moments of system size, is studied. Both solutions are compared with the exact results under several service time distributions with specific parameter values. Our numerical investigations demonstrate that the use of the second moment of system size for the available information is, in general, sufficient to obtain more accurate estimations than that of the first moment.
Beginning Oracle Database 11g Administration: From Novice to Professional
Authors: Iggy Fernandez
Venue:  (2009)

Open the door to a career as an Oracle database administrator as you learn to plan for and install the Oracle Database software. Then learn the rudiments of database administration from longtime Oracle expert Iggy Fernandez. Take advantage of the high demand for Oracle expertise and use Beginning Oracle Database 11g Administration to launch you on the right track to Oracle DBA career success. Gets you started in all key areas of database administration Provides a sound foundation on which to build your career Written in a clear, tothepoint style by Oracle expert and popular speaker Iggy Fernandez What youll learn Install the Oracle Database software and create databases. Plan for proper server sizing, file placement, and schema design. Protect your data through a sound backup and recovery scheme. Investigate and solve performance problems. Monitor to detect impending problems before your users do. Make changes and perform other maintenance as your database grows. Who is this book for? Are you an aspiring database professional who wants to manage databases built with one of the worlds most widely used database management systems? Are you a developer who wants to use the free version of Oracle Database for a project? Have you suddenly been thrust into a database administration role as part of your job? If your answer is yes to any of these questions, this book can help you out. It was written with you in mind. About the Apress Beginning Series The Beginning series from Apress is the right choice to get the information you need to land that crucial entrylevel job. These books will teach you a standard and important technology from the ground up because they are explicitly designed to take you from novice to professional. Youll start your journey by seeing what you need to knowbut without needless theory and filler. Youll build your skill set by learning how to put together realworld projects step by step. So whether your goal is your next career challenge or a new learning opportunity, the Beginning series from Apress will take you thereit is your trusted guide through unfamiliar territory!
A simulation approach to the evaluation of operational costs and performance in liner shipping operations
Authors: Aldo A. McLean, William E. Biles
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper presents a simulation model of the operation of a liner shipping network that considers multiple service routes and schedules. The objective is to evaluate the operational costs and performance associated with liner shipping, as well as the impact of individual service schedules on the overall system. The approach proposes a discrete-event simulation model where shipping activities, container ship operations, and intermodal container movements are considered. The model allows for direct and transshipment operations of container cargo, and the evaluation of fuel consumption and other logistics metrics. The model is used to evaluate a liner shipping network consisting of four service routes, up to 64 container ships, and up to 20 ports with diverse physical characteristics and cost components. The results show the contribution of service routes, ports, container ships, and containers to the cost and performance of the system.
Component-Based Multi-threading Support of the Multi-core Mobile Software
Authors: Hongjun Dai, Tianzhou Chen, Zhiping Jia
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

With the incoming times of multi-core architecture, the mobile platform will focus on the chip multiprocessor design too. To fully exert this advantage, the software can be component-based development to use the multi-threading characters. In this paper, thread is encapsulated by the component model for the support of the CPU cores and the easy development of the large program. Some research about the component-based multi-threading support of the multi-core embedded software is also taken out.
A System Architecture for Ubiquitous Tracking Environments
Authors: Manuel Huber, Daniel Pustka, Peter Keitler, Florian Echtler, Gudrun Klinker
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

Ubiquitous tracking setups, covering large tracking areas with many heterogeneous sensors of varying accuracy, require dedicated middlware to facilitate development of stationary and mobile applications by providing a simple interface and encapsulating the details of sensing, calibration and sensor fusion. In this paper we present a centrally coordinated peer-to-peer architecture for ubiquitous tracking, where a server computes optimal data flow configurations for sensor and application clients, which are directly exchanging tracking data with low latency using a light-weight data flow framework. The server's decisions are inferred from an actively maintained central spatial relationship graph (SRG) using spatial relationship patterns. The system is compared to a previous Ubitrack implementation using the highly distributed DWARF middleware. It exhibits significantly better performance in a reference scenario.
Impact of Usability on Software Requirements and Design
Authors: Natalia Juristo
Venue: Software Engineering: International Summer Schools, ISSSE 2006-2008, Salerno, Italy, Revised Tutorial Lectures (2009)

Like any other quality attribute, usability imposes specific constraints on software components. We have empirically corroborated that software design and usability are related. Therefore usability features impacting design need to be considered from a functional viewpoint at requirements stage. But discovering and documenting usability features is likely to be beyond the usability knowledge of most requirements engineers, developers and users. We propose an approach based on developing specific guidelines that capitalize upon key elements recurrently intervening in the usability features elicitation and specification. Developers can use these guidelines to ask the appropriate questions and capture usability requirements information. This practice should lead to build software with higher usability.
"wavers": a perceptible vibration system
Authors: Takashi Suzuki, Kunihiro Nishimura, Michitaka Hirose
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

"wavers" is a novel perceptible vibration system which enables a user to feel the difference of various textures. Tracing and scratching the textures make sounds. This system translates these sounds into perceptible vibration. The "wavers" consists mainly of vibrators and a vibration board. When the user is on the vibration board and trace or scratch it with a gripping environment, the user can feel texture directly with their body. The "wavers" aims to shed light on how to bind information to vibration by looking into the relationship between sound and vibration, the usage of vibration, and the way vibration is perceived.
Media Browsing for Mobile Devices Based on Resolution Adaptive Recommendation
Authors: Yi Liu, Zhi Yang, Xiaoyu Deng, Jiajun Bu, Chun Chen
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

This paper presents a system to facilitate the mobile devices to browse and retrieve video clips from a large amount of media contents. The media server in the proposed system is capable of recommending video clips to users that is adapt to their resolutions. Users are able to send feedbacks about user experiences to the server through the interactive client. Based on the user feedbacks, the media server could update the metadata for video clips such as popularity and acceptable resolution. In addition, redundant versions with lower resolution are generated for video clips by estimating their popularities, and sent to users with lower resolution directly to save the downsizing transcoding process. Experimental results demonstrate that user experiences are improved according to the increase of positive user feedbacks and the decrease of average transcoding delay.
Hanmadang: entertainment systems for massive face-to-face interaction
Authors: Geonhyeok Go, Sujung Han, Jongeun Lee, Yuri Choi, Bowen Sun, Youngwoo Park, Donggi Jung, Sungjae Hwang, Changyoung Lim
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

We created entertainment systems called "Hanmadang". The goal of the Hanmadang project is to allow players to experience massive face-to-face interaction. To reduce entry barriers of participation, it enables players to use their own mobile phone as an input interface by using an audio response system. Two games "Youngcha!" and "Hankanoid" are developed as parts of this project.
Fast 3D reconstruction and recognition
Authors: Marcos A. Rodrigues, Alan Robinson, Willie Brink
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

In this paper we discuss methods for 3D reconstruction from a single 2D image using multiple stripe line projection. The method allows 3D reconstruction in 40 milliseconds, which renders it suitable for on-line reconstruction with applications into security, manufacturing, medical engineering and entertainment industries. We start by discussing the mathematical fundamentals of 3D reconstruction and the required post-processing operations in 3D to render the models suitable for biometric applications such as noise removal, hole filling, smoothing and mesh subdivision. The incorporation of data acquired as 3D surface scans of human faces into such applications present particular challenges concerning identification and modelling of features of interest. The challenge is to accurately and consistently find predefined features in 3D such as the position of the eyes and the tip of the nose for instance. A method is presented with recognition rates up to 97% and a preliminary sensitivity analysis is carried out concerning reconstructed and subdivided models.
Fairness and conspiracy concepts in concurrent systems
Authors: Anup Kumar Bandyopadhyay
Venue: ACM SIGSOFT Software Engineering Notes (2009)

Many different fairness notions are available in literature. One should choose the proper definition that match with the system under consideration. In this paper we consider two known fairness definitions, viz., weak fairness and strong fairness. It is argued that these concepts are suitable for determining the degree of fairness of a given system. For only starvation freedom we require a minimum degree of fairness which we call least fairness. This idea is illustrated using two practical examples. Conspiracy is another very important issue in concurrent system. We have defined conspiracy in connection with all the fairness notions. Conspiracy resistant implementation is illustrated using a starvation free solution to dining philosophers problem. Dijkstra's weakest precondition calculus is used as the analytical tool.
Area-based gossip multicast
Authors: Christian Seeger, Bettina Kemme, Patric Kabus, Alejandro Buchmann
Venue: Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games (2008)

This paper presents areacast, a dynamic, area-based gossip multicast that enables a node to multicast messages only to nodes with a shared interest. This multicast can be used in multiplayer games where players want to send position updates, that is information that they have moved in the virtual game world, to players that reside close to them in the game world. As nodes continuously change their position the set of nodes in their neighborhood changes, too. areacast is able to handle this dynamism in a truly peer-to-peer fashion as each node keeps track of its current neighbors detecting new neighbors very fast. We evaluate our approach using game simulations where players either walk randomly in the game field or flock to a few hotspots. The results show that areacast is able to disseminate messages very fast to neighbors while not overloading the network.
Resource aware mapping on coarse grained reconfigurable arrays
Authors: Grigorios Dimitroulakos, Stavros Georgiopoulos, Michalis D. Galanis, Costas E. Goutis
Venue: Microprocessors Microsystems (2009)

Coarse grain reconfigurable array architectures have become increasingly popular due to their flexibility, scalability and performance. However, the mapping of programs on these architectures is characterized by huge complexity. This work presents a new mapping methodology for effectively mapping applications on coarse grained reconfigurable arrays. The core of this methodology comprises of the scheduling and register allocation phases performed, for the first time in the case of CGRAs, in a single step. Additionally, modulo scheduling with backtracking capability is incorporated in this scheme. The main contribution of this work includes a novel technique for minimizing the memory bandwidth bottleneck, a new priority scheme and a new set of heuristics which target on the maximization of the Instruction Level Parallelism by efficiently managing the architecture's resources. The overall approach is retargetable with respect to a parametric architecture template modelling a large number of architecture alternatives and it has been automated with a prototype tool which permits experimental exploration. The experimental results showed that the achieved performance figures are very close to the most effective ones derived from the theoretical study on the architecture's resources and the applications requirements. Moreover, the application of the bandwidth optimization technique lead to a 20-130% increase on operation parallelism. Finally, the experiments quantified the benefit from applying the new priority scheme and heuristics.
Non-photorealistic Rendering Using Genetic Programming
Authors: Perry Barile, Vic Ciesielski, Karen Trist
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

We take a novel approach to Non-Photorealistic Rendering by adapting genetic programming in combination with computer graphics drawing techniques. As a GP tree is evaluated, upon encountering certain nodes referred to as "Draw" nodes, information contained within such nodes are sent to one of three virtual canvasses and a mark is deposited on the canvas. For two of the canvasses the user is able to define custom brushes to be applied to the canvas. Drawing functions are supplied with little localised information regarding the target image. Based on this local data, the drawing functions are enabled to apply contextualized information to the canvas. The obtained results include a "Shroud of Turin" effect, a "Decal" effect and a "Starburst" effect.
Reliability versus performance for critical applications
Authors: Alain Girault, írik Saule, Denis Trystram
Venue: Journal of Parallel and Distributed Computing (2009)

Applications implemented on critical systems are subject to both safety critical and real-time constraints. Classically, applications are specified as precedence task graphs that must be scheduled onto a given target multiprocessor heterogeneous architecture. We propose a new method for simultaneously optimizing two objectives: the execution time and the reliability of the schedule. The problem is decomposed into two successive steps: a spatial allocation during which the reliability is maximized (randomized algorithm), and a scheduling during which the makespan is minimized (list scheduling algorithm). It allows us to produce several trade-off solutions, among which the user can choose the solution that best fits the application's requirements. Reliability is increased by replicating adequate tasks onto well chosen processors. Our fault model assumes that processors are fail-silent, that they are subject to transient failures, and that the occurrences of failures follow a constant parameter Poisson law. We assess and validate our method by running extensive simulations on both random graphs and actual application graphs. They show that it is competitive, in terms of makespan, compared to existing reference scheduling methods for heterogeneous processors (HEFT), while providing a better reliability.
Software product integration: A case study-based synthesis of reference models
Authors: Stig Larsson, Petri Myllyperkiö, Fredrik Ekdahl, Ivica Crnkovic
Venue: Information and Software Technology (2009)

In software intensive systems the integration becomes complex since both software and hardware components are integrated and run in the execution environment for the first time. Support for this stage is thus essential. Practices for Product Integration are described in different reference models. We have investigated these and compared them with activities performed in seven product development projects. Our conclusion is that descriptions of best practices in product integration are available in different reference models, but need to be merged into one set of practices. Through case studies we see that the described practices are insufficiently used in industry, and that organizations would benefit from adhering to them. Our investigations indicate that a set of practices are necessary to be successful in software product integration: define and check criteria for integration, review interface descriptions and ensure coordination of interface changes, and deliver components as agreed. In addition to these, a set of practices are supporting the integration activities, including the definition of an integration strategy, and the establishment of a suitable integration environment.
Transactions in Constraint Handling Rules
Authors: Tom Schrijvers, Martin Sulzmann
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

CHR is a highly concurrent language, and yet it is by no means a trivial task to write correct concurrent CHR programs. We propose a new semantics for CHR, which allows specifying and reasoning about transactions. Transactions alleviate the complexity of writing concurrent programs by offering entire derivations to run atomically and in isolation.We derive several program transformations based on our semantics that transform particular classes of transitional CHR programs to non-transactional ones. These transformations are useful because they obviate a general purpose transaction manager, and may lift unnecessary sequentialization present in the transactional semantics.
Auction-Based Traffic Management: Towards Effective Concurrent Utilization of Road Intersections
Authors: Heiko Schepperle, Klemens Böhm
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

Valuation-aware traffic-control mechanisms for road intersections take the valuations of reduced waiting time of the individual drivers into account. They use agents to avoid any disturbance of the driver, and they feature mechanisms specifically designed for negotiating valuations. While such mechanisms do indeed increase overall driver satisfaction, they only allow one vehicle at a time to use the intersection so far. But the concurrent utilization of an intersection is an important feature needed in reality. This paper proposes new auction-based intersectioncontrol mechanisms allowing for concurrency. Their design has been challenging due to complex traffic-specific requirements like the high number of agents involved or varying space and time consumption of vehicles crossing the intersection. Experiments show that they yield a significantly higher degree of overall driver satisfaction than state-of-the-art mechanisms.
Increasing Bid Expressiveness for Effective and Balanced E-Barter Trading
Authors: Azzurra Ragone, Tommaso Noia, Eugenio Sciascio, Francesco M. Donini
Venue: Declarative Agent Languages and Technologies VI: 6th International Workshop, DALT 2008, Estoril, Portugal, May 12, 2008, Revised Selected and Invited Papers (2008)

We present a novel knowledge-based approach for automated electronic barter trade systems. An e-barter is basically a closed e-marketplace, where agents may exchange (buy/sell) goods ---or equivalent trade dollars--- only with other participants to the e-barter. Obviously, in such systems one of the major issues is keeping exchanges as balanced as possible. If the description of goods or services to be exchanged is simple and limited to a well defined set, e.g., oil, wheat, transport, etc., then an exchange based only on price and quantity is enough. But, what if goods or services to be exchanged are described in a complex way? Is it a suitable exchange the one involving mobile phones supporting video streaming with a QWERTY keyboard if the agent is looking for smart phones? Those two descriptions, although very different form a syntactic point of view, are very similar with respect to their meaning (semantics). How could an agent manage and exploit the knowledge on a given domain to deal with such a semantic information and optimize exchanges?We focus on how to find most promising matches, in a many-to-many matchmaking process, between bids (supplies/demands), taking into account not only the price and quantities as in classical barter trade systems, but also a semantic similarity among bid descriptions while keeping exchanges balanced.To this aim we use a logical language to express agent preferences, thereby enhancing bid expressiveness. We also define a logic-based utility function that allows to evaluate the semantic similarity between bids. Finally we illustrate the optimization problem we solve in order to clear the market.
Average Update Times for Fully-Dynamic All-Pairs Shortest Paths
Authors: Tobias Friedrich, Nils Hebbinghaus
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We study the fully-dynamic all pairs shortest path problem for graphs with arbitrary non-negative edge weights. It is known for digraphs that an update of the distance matrix costs $\ensuremath{{\cal \tilde O}}(n^{2.75})$ worst-case time [Thorup, STOC &rsquo;05] and $\ensuremath{{\cal \tilde O}}(n^2)$ amortized time [Demetrescu and Italiano, J.ACM &rsquo;04] where n is the number of vertices. We present the first average-case analysis of the undirected problem. For a random update we show that the expected time per update is bounded by O(n 4/3&thinsp;+&thinsp;&epsilon; ) for all &epsilon;>&thinsp;0.