ppxscal/embedding_network huggingface dataset:
Cooperating Embedded Systems and Wireless Sensor Networks, 1 edition
Authors: Michel Banatre, Pedro Jose Marron, Anibal Ollero, Adam Wolisz, Michel Banatre, Pedro Jose Marron, Anibal Ollero, Adam Wolisz
Venue:  (2008)

A number of different system concepts have become apparent in the broader context of embedded systems over the past few years. Whilst there are some differences between these, this book argues that in fact there is much they share in common, particularly the important notions of control, heterogenity, wireless communication, dynamics/ad hoc nature and cost. The first part of the book covers cooperating object applications and the currently available application scenarios, such as control and automation, healthcare, and security and surveillance. The second part discusses paradigms for algorithms and interactions. The third part covers various types of vertical system functions, including data aggregation, resource management and time synchronization. The fourth part outlines system architecture and programming models, outlining all currently available architectural models and middleware approaches that can be used to abstract the complexity of cooperating object technology. Finally, the book concludes with a discussion of the trends guiding current research and gives suggestions as to possible future developments and how various shortcomings in the technology can be overcome.
Struggles of new college graduates in their first software development job
Authors: Andrew Begel, Beth Simon
Venue: ACM SIGCSE Bulletin (2008)

How do new college graduates experience their first software development jobs? In what ways are they prepared by their educational experiences, and in what ways do they struggle to be productive in their new positions? We report on a "fly-on-the-wall" observational study of eight recent college graduates in their first six months of a software development position at Microsoft Corporation. After a total of 85 hours of on-the-job observation, we report on the common abilities evidenced by new software developers including how to program, how to write design specifications, and evidence of persistence strategies for problem-solving. We also classify some of the common ways new software developers were observed getting stuck: communication, collaboration, technical, cognition, and orientation. We report on some common misconceptions of new developers which often frustrate them and hinder them in their jobs, and conclude with recommendations to align Computer Science curricula with the observed needs of new professional developers.
Multi-criteria upper-body human motion adaptation
Authors: K. Alexopoulos, D. Mavrikios, M. Pappas, E. Ntelis, G. Chryssolouris
Venue: International Journal of Computer Integrated Manufacturing (2007)

Computer-aided simulation of human motion has enabled the integration of human factors in the evaluation of product, process and workplace designs. Realistic human motion simulation can be generated on the basis of existing captured motion. The objective of this work is the development of a new approach for adapting a given motion of a digital human model to new anthropometrics and environment constraints. In order to achieve this objective an algorithm, based on multi-criteria decision making, has been conceptualized and implemented. The proposed algorithm is based on the evaluation of randomly generated human postures, with a number of criteria suitable for preserving desirable qualities of the initial motion while the new constraints are being satisfied. The multi-criteria human motion adaptation (MCMA) algorithm is tested in a pilot case that investigates the opening of a car door from the driver's seated position. The evaluation demonstrates the prediction capabilities of the algorithm, when anthropometrics and environment parameters are modified. The algorithm generates accurate and realistic human motions that can be used in computer-aided design for ergonomics.
Fast Handoff Scheme Using Location Information
Authors: M. Mansour, J. E. Mellor, I. Awan
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Frequent handoffs in mobile IP scheme increase latency and loss of packets. Hierarchical mobility management has been introduced to reduce the impact of mobility by handling local movements locally and hiding them from Home Agent. In this paper we propose a low Latency handoff scheme using location information that can reduce the handoff latency and packet loss. Every foreign agent will contain the location of their foreign agent’s neighbors, and can detect the movement and the direction of the mobile host. The mobile host periodically informs its serving foreign agent of its location. The current foreign agent can know the distance between foreign agent and mobile host. Handoff latency is minimized by initiating data forwarding to the new foreign agent at the time that the mobile host becomes close to the threshold value based on the coverage area of the foreign agent. We show through simulations that the use of the proactive scheme with location information in the foreign agent allows for accomplishing Fast Handoff and reduced packet loss. Simulations results show that our scheme is more efficient other scheme, in term of packet loss and handoff delay.
Zebra: exploring users' engagement in fieldwork
Authors: Yann Riche, Matthew Simpson, Stephen Viller
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

Participatory Design is a design approach that provides a popular set of techniques for designing interactive systems in collaboration with end-users. Technology probes are one of such techniques, developed recently to encourage users' engagement with design ideas while capturing interaction. In this paper, we describe a technology probe called Zebra, which aimed at exploring the design of an observation tool for fieldwork with busy professionals. We deployed Zebra in the coffee room of our lab and observed researchers' reactions to the proposed concepts it embodied, both as researchers and as participants. We found that participants engaged with the probe in ways ranging from playful performances, through to abandoning the social space. Based on analysis of the collected qualitative and quantitative data, we present our reflections on the Zebra probe, how it eased the burden of engagement in the design process, and helped us better understand the potential of the observation tool for participatory design with busy professionals.
Listed companies' financial distress prediction based on weighted majority voting combination of multiple classifiers
Authors: Jie Sun, Hui Li
Venue: Expert Systems with Applications: An International Journal (2008)

How to effectively predict financial distress is an important problem in corporate financial management. Though much attention has been paid to financial distress prediction methods based on single classifier, its limitation of uncertainty and benefit of multiple classifier combination for financial distress prediction has also been neglected. This paper puts forward a financial distress prediction method based on weighted majority voting combination of multiple classifiers. The framework of multiple classifier combination system, model of weighted majority voting combination, basic classifiers' voting weight model and basic classifiers' selection principles are discussed in detail. Empirical experiment with Chinese listed companies' real world data indicates that this method can greatly improve the average prediction accuracy and stability, and it is more suitable for financial distress prediction than single classifiers.
An ALU-Based BIST Scheme for Word-Organized RAMs
Authors: Ioannis Voyiatzis
Venue: IEEE Transactions on Computers (2008)

Word-organized memories are typically tested by repeatedly applying a test for bit-oriented memories using different data backgrounds (which depend on the used intra-word fault model), resulting in limited fault coverage. In this paper a new approach for testing word-organized memories is presented, that systematically converts tests for bit-organized memories to tests for word-organized memories. The implementation of the proposed scheme in hardware is based on an ALU whose inputs are driven by a barrel shifter. Since such modules commonly exist in current chips, the hardware overhead of the scheme is extremely low.
Networks for a symbiotic human life with robots
Authors: Muneyuki Shimokura, Shuichi Nakanishi, Tadashi Ohta
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

It is expected that the age when men and robots live together is close at hand. In the age, his/her everyday life will be helped by robots. This article proposes a network software architecture that realizes a space where a man and robots live together. It also proposes a method for describing service programs using a rule based language. For service architecture, a concept of integrated services, which is becoming standard in web services, is adopted. A prototype system for a robot control system was made based on the proposed architecture, and the proposed architecture was confirmed as reasonable.
Pagerank based clustering of hypertext document collections
Authors: Konstantin Avrachenkov, Vladimir Dobrynin, Danil Nemirovsky, Son Kim Pham, Elena Smirnova
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hyper-text links. Here we propose a novel PageRank based clustering (PRC) algorithm which uses the hypertext structure. The PRC algorithm produces graph partitioning with high modularity and coverage. The comparison of the PRC algorithm with two content based clustering algorithms shows that there is a good match between PRC clustering and content based clustering.
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
Authors: Agostino Dovier, Carla Piazza, Gianfranco Rossi
Venue: ACM Transactions on Computational Logic (TOCL) (2008)

Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of computer science. They have been analyzed from an axiomatic point of view with a parametric approach in Dovier et al. &lsqb;1998&rsqb;, where the relevant unification algorithms have been developed. In this article, we extend these results considering more general constraints, namely, equality and membership constraints and their negative counterparts.
Multi-server queues subject to server interruptions
Authors: Bart Vinck, Herwig Bruneel
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

This paper concerns discrete-time queueing systems operating under a first-come-first-served queueing discipline, with deterministic service times of one slot and subject to independent server interruptions. We derive a relationship between the probability generating functions of the system contents during an arbitrary slot and of the system delay of an arbitrary customer. This relationship is valid regardless of the nature of the arrival process. From this relationship we derive a relationship between the first and second-order moments of the said distributions. We show that the relationship also applies to certain subsystems of the class of system considered, and to the queue of a multi-server queueing system with geometric service times and uninterrupted servers.
ETSP: An Energy-Efficient Time Synchronization Protocol for Wireless Sensor Networks
Authors: Khurram Shahzad, Arshad Ali, N. D. Gohar
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Wireless Sensor Networks (WSN) have specific constraints and stringent requirements in contrast to traditional wired and wireless computer networks. Among these specific requirements, energy-efficiency is the most prominent. Sensor motes have finite amount of energy supply. In most WSN applications, hundreds or thousands of motes are deployed in an area (e.g., behind enemy lines or foliage) and there is no provision for battery recharging. Therefore, a fundamental constraint on WSN applications and services is to extend the network’s lifetime by making the batteries run longer. In this paper we propose an energy-efficient Time Synchronization Protocol, referred as ETSP, which gives significant improvement in energy consumption over existing time synchronization schemes. We first evaluate the existing Reference Broadcast Synchronization (RBS) and Time-sync Protocol for Sensor Networks (TPSN), which are two prominent examples of receiver-receiver and sender-receiver synchronization methods. This performance analysis demonstrates that combination of RBS and TPSN can work better than using these techniques separately. In the proposed ETSP protocol, we identify conditions to toggle between RBS and TPSN based on a threshold value. We experimentally and mathematically derive an optimal value of the switching threshold for different sensor motes. In this way we effectively reduce the number of transmissions which results in saving energy. Moreover, we assess the performance of our protocol on the bit error traces collected over a real WSN test bed to cater for retransmissions overload for the time synchronization protocols under consideration.
Introduction to Desktop Publishing with Digital Graphics, Student Edition, 1 edition
Authors: Kevin Niemeyer
Venue:  (2007)

Intoduction to Desktop Publishing with Digital Graphics is written specifically for secondary students. It is the only text that covers the four most popular applications: Microsoft Word, Microsoft Publisher, Adobe Illustrator, and Adobe Photoshop. The Projects Across the Curriculum feature reinforces skills in math, science, language arts, and social studies. We offer Online Resources which include rubrics, additional projects, data files, and solution files and provides a comprehensive solution for any curriculum.
Geometrical k-cut problem and an optimal solution for hypercubes
Authors: Sang-Young Cho
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

We introduce a generalization of the (s, t)-cut problem, called the Geometrical k-cut problem, with the concept of geometrical partitioning. A topology graph is employed to represent the geometrical structure of the partitioned nodes of a given k-terminal graph. This problem is NP-hard in general. We propose an optimal algorithm to solve the problem for hypercube topology graphs in polynomial time. The time complexity of the algorithm is O(qn3), where q is the dimension of a hypercube graph and n is the number of nodes in a k-terminal graph, with the Goldberg-Tarjan's network flow algorithm.
Negotiation in the Requirements Elicitation and Analysis Process
Authors: Sabrina Ahmad
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Requirements elicitation and analysis is the most crucial process in requirements engineering since it moulds the shape of the desired end product. In dealing with a system’s stakeholders in a process to elicit the requirements, conflicts are inevitable. In the initial state, usually, all the stakeholders have a common goal; to build a system. However as an individual, they do have their own perspectives and perceptions. In addition, the stakeholders, either as a representative of end users, a decision maker or a developer, have different concerns, priorities and responsibilities. This paper considers introducing negotiation spiral model with supporting elements in the requirements elicitation and analysis process. Many researches show that negotiation is necessary to handle conflicts in order to gain better requirements. It is believed that the quality of intermediate deliverables like the requirements document is correlated with the quality of the final product.The advantages of implementing negotiation process are well aligned requirements by all the stakeholders, improved system quality, a sound basis for resource estimation and less resource wastage.
A multiple parallel download scheme with server throughput and client bandwidth considerations for data grids
Authors: Ruay-Shiung Chang, Ming-Huang Guo, Hau-Chin Lin
Venue: Future Generation Computer Systems (2008)

Though computer technology advances quickly, the computing speed and storage capacity of a single computer still cannot satisfy the requirements of many applications. As a result, grids have emerged to utilize the collective power of many computers. One of them, the data grid, provides a mechanism for handling a large amount of data. One of the characteristics of a data grid is to replicate files to many different computers such that a popular file would be more available. If a grid site does not have a file, it will have to download it from other grid sites. Thus, the parallel download method, which allows a user to download different parts of a file from various computers simultaneously, is used to decrease download time. However, multiple parallel downloads will affect one another. Thus if all jobs in the grid system use parallel download, the problem of resource competition and conflict will happen. In this paper, we propose a parallel download scheme considering the server output throughput limits and client input bandwidth constraints. Experimental results show that the proposed download scheme outperforms static and dynamic parallel download schemes.
Wireless Sensor Network-Based Adaptive Vehicle Navigation in Multihop-Relay WiMAX Networks
Authors: Ben-Jye Chang, Bo-Jhang Huang, Ying-Hsin Liang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

The main goal of vehicle navigation systems is to determine the optimal routing path for achieving the least travel time and exhausted gasoline. Most navigation systems use the static shortest path routing algorithm or use optional traffic information broadcasted by a centralized Traffic Information Center (TIC) to avoid routing to heavy traffic load roads. Since the traffic information may be gathered from few monitoring devices that only covers some specific highways and roads, it results in some disadvantages, including only supporting partial traffic information on some roads, long update period and low reliability of using a centralized TIC. In consequence, the determined route could be the shortest distance route but it may not meet the demands of the optimal routing: the least travel time and exhausted gasoline. Therefore, we propose herein the wireless sensor network-based adaptive navigation approach, which uses the WiMAX multihop relay networks as the inter-vehicle communications (IVC) to increase the reliability and efficiency of inter-vehicle communications. Real-time traffic information could be gathered from various types of sensors equipped on vehicles and exchanged among neighbor vehicles. As a result, the navigation system can obtain three metrics of the road traffic density, road class and road distance to determine the optimal route. Numerical results indicate that the proposed adaptive navigation approach outperforms other approaches in the average travel time and average exhausted gasoline while yielding competitive average travel distance.
Automated design of self-adjusting pipelines
Authors: Jieyi Long, Seda Ogrenci Memik
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

We propose a self-adjusting pipeline structure to enhance chip performance and robustness considering the effects of process variations. We achieve this by introducing delay sensors to monitor internal timing violations within a pipeline stage and variable clock skew buffers to adjust the timing of the pipeline stage based on the feedback from the delay sensors. Furthermore, we formulate the delay sensor insertion and variable clock skew configuration problem as a stochastic mixed-integer programming problem and propose a simulated-annealing based algorithm to solve it. A comparison between the designs with and without the self-adjusting enhancement reveals that, we are able to improve the average performance of a batch of chips by 9.5%.
Small world network model of personal consumption: Demand-side management in an expert system
Authors: Steven D. Silver, Phillip Cowans
Venue: Expert Systems with Applications: An International Journal (2008)

Representing personal consumption is important to a range of expert decision makers in academic, government and corporate settings. We cite the possible contribution of studying a system model of the use of information in personal consumption when agents are members of a small world network. Information has properties in non-rival borrowing and sensitivity to network memberships that individual agents do not typically include in heuristics they use in budget allocation. We use computational methods to show how an expert system in which a super agent using a model that includes properties of information and network parameters can define welfare maximizing allocation and policy to bring the allocation of individual agents closer to a welfare-maximizing allocation. Implications of systems with the dynamics we propose for representing demand-side management in expert systems are noted.
On convex embeddings of planar 3-connected graphs
Authors: Alexander Kelmans
Venue: Journal of Graph Theory (2000)

A well-known Tutte's theorem claims that every 3-connected planar graph has a convex embedding into the plane. Tutte's arguments also show that, moreover, for every nonseparating cycle C of a 3-connected graph G, there exists a convex embedding of G such that C is a boundary of the outer face in this embedding. We give a simple proof of this last result. Our proof is based on the fact that a 3-connected graph admits an ear assembly having some special properties with respect to the nonseparating cycles of the graph. This fact may be interesting and useful in itself. &copy; 2000 John Wiley & Sons, Inc. J. Graph Theory 33: 120&ndash;124, 2000
Techniques for fully integrated intra-/inter-chip optical communication
Authors: Claudio Favi, Edoardo Charbon
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In this paper we propose to replace all data and control pads generally present in conventional chips with a new type of ultra-compact, low-power optical interconnect implemented almost entirely in CMOS. The proposed scheme enables optical through-chip buses that could service hundreds of thinned stacked dies. High throughputs and communication density could be achieved even in tight power budgets. The core of the optical interconnect is a single-photon avalanche diode operating in pulse position modulation. We demonstrate how throughputs of several gigabits per second may be achieved. We also show a systematic analysis of the system and preliminary results to support its suitability in emerging DSM technologies.
Development of a STM compatible ion emitter capable of atomic imaging resolution
Authors: D. Martrou, J. Gierak
Venue: Microelectronic Engineering (2008)

In this article we report our preliminary experiments concerning the development and the tests of a miniature punctual writing/reading device (a miniature liquid ion emitter) that can be also used as an imaging tool in scanning tunneling microscopy. The objective of our development is to evaluate the performance of a direct nanofabrication tool capable to locally modify the surface of a sample in either erosion or deposition mode and sequentially to perform imaging of the surface with the highest possible resolution using the STM mode.