ppxscal/embedding_network huggingface dataset:
A flexible middleware system for wireless sensor networks
Authors: Flávia Coimbra Delicato, Paulo F. Pires, Luci Pirmez, Luiz Fernando Rust da Costa Carmo
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

The current wireless sensor networks (WSN) are assumed to be designed for specific applications, having data communication protocols strongly coupled to applications. The future WSNs are envisioned as comprising of heterogeneous devices assisting to a large range of applications. To achieve this goal, a flexible middleware layer is needed, separating application specific features from the data communication protocol, while allowing applications to influence the WSN behavior for energy efficiency. We propose a service-based middleware system for WSNs. In our proposal, sensor nodes are service providers and applications are clients of such services. Our main goal is to enable an interoperability layer among applications and sensor networks, among different sensors in a WSN and eventually among different WSN spread all over the world.
Recommending Resources in Mobile Personal Information Management
Authors: Wolfgang Woerndl, Aleksandar Hristov
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

We present an approach for personal information management for mobile devices like PDAs based on the Semantic Desktop. The main objective is to design and realize a recommendation system to identify interesting items (e.g. messages or documents) based on the current context (time and location) and a user's personal ontology. To do so, our algorithm uses an evaluation function to traverse the graph of resources and rank nodes. Relevant resources and other items such as points-of-interests can also be displayed on a map on the mobile device. The ideas have been implemented and (rudimentarily) tested in the "SeMoDesk" application.
Double-blind reviewing: more placebo than miracle cure?
Authors: Henning Schulzrinne
Venue: ACM SIGCOMM Computer Communication Review (2009)

In double-blind reviewing (DBR), both reviewers and authors are unaware of each others' identities and affiliations. DBR is said to increase review fairness. However, DBR may only be marginally effective in combating the randomness of the typical conference review process for highly-selective conferences. DBR may also make it more difficult to adequately review conference submissions that build on earlier work of the authors and have been partially published in workshops. I believe that DBR mainly increases the perceived fairness of the reviewing process, but that may be an important benefit. Rather than waiting until the final stages, the reviewing process needs to explicitly address the issue of workshop publications early on.
Short communication: GRID computing approach for multireservoir operating rules with uncertainty
Authors: Andrea Sulis
Venue: Environmental Modelling Software (2009)

Developing mathematical optimization models that define multireservoir operating rules that are worthy of being evaluated by simulation models is a challenging task. The traditional approach can easily be scaled, and GRID computing can reduce computation times for large water resource systems. The potential for GRID computing in this area of research is largely unexplored. In this paper, the migration of a mixed optimization-simulation approach and preliminary applications to a water system in Southern Italy are presented. Results indicate that GRID computing provides significant savings in computation time.
Finite Element Approximation of an Elliptic Boundary Value Problem with Interface
Authors: Boško S. Jovanović, Lubin G. Vulkov
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

For elliptic boundary value problem in domain with smooth curvilinear boundary and interface a finite element approximation is constructed. Convergence is proved in Sobolev like spaces $\widetilde W_2^1$ and $\widetilde L_2$.
Post-floorplanning power/ground ring synthesis for multiple-supply-voltage designs
Authors: Wan-Ping Lee, Diana Marculescu, Yao-Wen Chang
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

The multiple-supply voltage (MSV) design style has been extensively applied to mitigate dynamic-power consumption. The MSV design paradigm, however, brings many crucial challenges, especially in the power-ring synthesis. Unlike the previous works that form the power rings as the enclosing bounding boxes of voltage islands, we enable power rings alignment to the outer boundaries of voltage islands. With this new formulation, the power-ring estimation becomes more accurate during floorplanning, and the power-ring synthesis is more practical after floorplanning. In this paper, we first propose a linear-time voltage-island power-ring search algorithm to identify the power rings of voltage islands and then present a linear-time optimal power-ring corner-patching algorithm to minimize the number of corners in the power rings by using post-floorplanning whitespaces. Experimental results first demonstrate that reducing corners in power rings significantly mitigates IR drop, and then show that the proposed algorithm can reduce the number of corners by 33% on average for the GSRC floorplan benchmarks. In particular, the total running time for the 16 GSRC benchmarks is less than one second on an AMD-64 machine with a 2.2 GHz CPU and 8 GB memory.
Slab Cluster Based Planning and Scheduling Method of CC-DHCR
Authors: Sujian Li, Helan Liang, Yanjun Huang, Bo Hu
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Focusing on the limitations of the traditional CCDHCR scheduling methods that are in high planning complexity and rarely attack dynamic scheduling problem, a new CC-DHCR integrated planning and scheduling method base on slab cluster is put forward. The key idea is, on one hand, to classify slabs and coils into slab clusters and coil clusters respectively according to the slab and coil clustering rules in the batch planning layer, so as to improve the planing efficiency; On the other hand, to design slab cluster based strategy in the dynamic scheduling layer, based on which the sequences of entering the reheat furnace for slabs from the same slab cluster can be adjusted dynamically according to the actual production conditions. Results of test with data from practical production process show that the method can effectively solve the CC-DHCR scheduling problem, and increase the DHCR ratio.
Cross-boundary information sharing in e-governance based on third-party platform: a case study on iTowNet public service platform
Authors: Wensheng Yang
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Since the introduction of e-Governance, there has been a greater and more urgent need to realize cross-boundary information sharing for government agencies, various non-governmental organizations (NGOs), and the public. This paper presents iTowNet Public Service Platform - a third-party model set up to promote cross-boundary information sharing for China's quality inspection and quarantine e-Governance initiatives. It reports the practical measures taken to promote information sharing among stakeholders, crucial success factors, and future challenges.
Usability heuristics for networked multiplayer games
Authors: David Pinelle, Nelson Wong, Tadeusz Stach, Carl Gutwin
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

Networked multiplayer games must support a much wider variety of interactions than single-player games because networked games involve communication and coordination between players. This means that designers must consider additional usability issues that relate to group play - but there are currently no usability engineering methods that are specifically oriented towards the needs of multiplayer games. To address this problem, we developed a new set of usability heuristics, called Networked Game Heuristics (NGH), which can be used in the design and evaluation of networked multiplayer games. The new heuristics were identified by analyzing problem reports from 382 reviews of networked PC games, covering six main genres. We aggregated problem reports into ten problem categories (covering issues from session management to cheating to training for novice players) and developed heuristics that describe how these usability problems can be avoided. We tested the new heuristics by having evaluators use them and an existing set to assess the usability of two networked games. Evaluators found more usability problems with NGH, and stated that the new heuristics were better for evaluating multiplayer game usability. Our research is the first to present networked game heuristics that are derived from real problem reports, and the first to evaluate the heuristics' effectiveness in a realistic usability test.
Design and fabrication of a micro Alvarez lens array with a variable focal length
Authors: Chunning Huang, Lei Li, Allen Y. Yi
Venue: Microsystem Technologies (2009)

A 5&#x00a0;&#x00d7;&#x00a0;5 micro Alvarez lens array mold was fabricated using a 5-axis ultraprecision diamond machine and an Alvarez lens array was manufactured by injection molding process. Unlike conventional processes for asymmetrical element fabrication such as small tool grinding, this research demonstrates slow tool servo broaching process that allows the entire Alvarez lens array to be accurately machined on a metal mold in a single operation. To further reduce manufacturing cost, injection molding was used to fabricate the Alvarez lens arrays. The mold and molded lenses were both measured using an optical profiler. All measured profiles showed a good agreement with design and surface roughness also indicated an optical surface finish. The functionality of the molded polymeric lens arrays was achieved when the focal lengths were varied by laterally translating the molded Alvarez lens array pair. This research is a demonstration of the capability of fabricating complex optics using the same approach.
Adaptive and energy efficient clustering architecture for dynamic sensor networks
Authors: E. M. Saad, M. H. Awadalla, R. R. Darwish
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Clustering is an effective topology control approach in sensor networks. This paper proposes a distributed and adaptive clustering architecture for dynamic sensor networks. The proposed architecture comprises an approach for energy-efficient clustering with adaptive node activity for achieving a good performance in terms of system lifetime and network coverage quality. This architecture demonstrates a uniform cluster head distribution across the network in addition to a desirable network coverage. Furthermore, the paper presents an analytical approach to disclose the relationship between network density and coverage quality. Experiments were conducted to validate the proposed architecture. The analytical and simulation results demonstrate that the proposed architecture prolongs network lifetime meanwhile preserving a highly coverage quality.
Designing Web-Based Mobile Services with REST
Authors: Claudio Riva, Markku Laitkorpi
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

The Web is emerging as the favorite platform for delivering applications and services. The REST architectural style comprises the key principles behind its design and success. While REST is originally defined in the context of publishing hypermedia documents, it is becoming a popular method for implementing Web services as well. The goal of this paper is to explore the principles of the REST style for building mobile services and to address the mobile specific constraints. We present the design method that we have followed for building a basic photo storage service. Our preliminary evaluation confirms that REST is a flexible and extensible approach for building mobile services.
From MRI to anatomical simulation of the hip joint
Authors: Lazhari Assassi, Caecilia Charbonnier, Jérôme Schmid, Pascal Volino, Nadia Magnenat-Thalmann
Venue: Computer Animation and Virtual Worlds (2009)

This paper describes a methodology for the simulation of musculoskeletal disorders. Our clinical study is related to osteoarthritis (OA) of the hip, a pathogenesis possibly due to impingements. These bone collisions lead to abnormal joint mechanics which is characterized by contact pressure and stress distribution upon the joint cartilages. The proposed methodology combines different approaches from modeling to simulation. The simulation is based on patient-specific anatomical models, where acquisition modalities are noninvasive and flexible. Based on static magnetic resonance imaging (MRI) data, a discrete deformable models method is used for modeling the organs of the musculoskeletal system. Femoroacetabular movements are estimated using an optical motion capture system and are validated by a dynamic MRI analysis. To achieve accurate deformations, techniques to generate volumetric meshes are developed based on the medial axis (MA) information. Finally, a computationally efficient fast functional joint model is used to simulate the mechanical behavior of the soft tissues. The goal of such a simulation is to allow the investigation of the relevant contact and cartilages deformation under movement, which can be useful for diagnosis, pre- or post-operative planning and training. This will benefit further developments in surgical techniques and minimally invasive procedures. Copyright &copy; 2008 John Wiley & Sons, Ltd.
The input-aware dynamic adaptation of area and performance for reconfigurable accelerator
Authors: Like Yan, Gang Wang, Tianzhou Chen
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Attaching reconfigurable loop accelerator to a processor is a promising way to improve the performance and efficiency of the system. It's usually to unroll a loop to increase the parallelism of a loop accelerator. While the higher degree a loop is unrolled, the more reconfigurable area is needed. However, an observation is that the utilization of the loop accelerator is relative to the input. Focusing on the area and performance balance, a dynamically adaptive reconfigurable accelerator framework is proposed on CPU/RA architecture in the paper. Firstly, the inputs are classified into certain predefined types. At run-time the input of the application will be monitored and then the accelerator will be reconfigured to accomplish the area-performance dynamic adaption. An accelerator selection model is also presented to choose an accelerator at run-time according to the predefined input types. And a bzip2 case study is presented, the experimental results demonstrated the feasibility of the approach, and shown that up to 93.6% reconfigurable area is saved at a cost of 1.6% performance lost in a best case.
Deciding array formulas with frugal axiom instantiation
Authors: Amit Goel, Sava Krstić, Alexander Fuchs
Venue: Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning (2008)

How to efficiently reason about arrays in an automated solver based on decision procedures? The most efficient SMT solvers of the day implement "lazy axiom instantiation": treat the array operations read and write as uninterpreted, but supply at appropriate times appropriately many---not too many, not too few---instances of array axioms as additional clauses. We give a precise account of this approach, specifying "how many" is enough for correctness, and showing how to be frugal and correct.
PhotoScope: visualizing spatiotemporal coverage of photos for construction management
Authors: Fuqu Wu, Melanie Tory
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

PhotoScope visualizes the spatiotemporal coverage of photos in a photo collection. It extends the standard photo browsing paradigm in two main ways: visualizing spatial coverage of photos, and indexing photos by a combination of spatial coverage, time, and content specifications. This approach enables users to browse and search space- and time-indexed photos more effectively. We designed PhotoScope specifically to address challenges in the construction management industry, where large photo collections are amassed to document project progress. These ideas may also apply to any photo collection that is spatially constrained and must be searched using spatial, temporal, and content criteria. We describe the design choices made when developing PhotoScope and the results of user evaluation.
Controlling Physical Multiagent Teams: Getting League-Independent Results from RoboCup Soccer - Volume 304 Dissertations in Artificial Intelligence - Infix ... in Artificial Intelligence)
Authors: O. Obst
Venue:  (2007)

During the last years, Robotic Soccer has become one of the most challenging research fields for multiagent systems (MAS). In RoboCup soccer, teams of autonomous agents have to cooperatively solve the problem of winning against another team of agents. There are different leagues to address a wide area of research problems. However, many of the solutions to these are also league-dependent. This publication contributes tools and techniques to create physical MAS in domains where each agent has insufficient capabilities for solving the problem alone. All contributions of this book address the problem of league-independent solutions and provide means to create more generally applicable approaches. The contributions of this work have shown to be useful within the simulated robotic soccer domain and real robotic soccer. As a result, more general MAS research problems can be stated, and domain knowledge can be shared between different leagues.
Aspects and class-based security: a survey of interactions between advice weaving and the Java 2 security model
Authors: Andreas Sewe, Christoph Bockisch, Mira Mezini
Venue: Proceedings of the 2nd Workshop on Virtual Machines and Intermediate Languages for emerging modularization mechanisms (2008)

Various aspect-oriented languages, e.g., AspectJ, Aspect-Werkz, and JAsCo, have been proposed as extensions to one particular object-oriented base language, namely Java. But these extensions do not fully take the interactions with the Java 2 security model into account. In particular, the implementation technique of advice weaving gives rise to two security issues: the erroneous assignment of aspects to protection domains and the violation of namespace separation. Therefore, a comprehensive discussion of the design choices available with respect to interactions with the dynamic class loading facilities of the Java VM is provided.
Experiences with just-in-time teaching in systems and design courses
Authors: Janet Davis
Venue: ACM SIGCSE Bulletin (2009)

I report on my experiences with Just-in-Time Teaching (JiTT) in two systems courses and two design courses as a new instructor at a small liberal arts college. My purposes are threefold: to further raise awareness of JiTT in the computer science education community, to show instructors can achieve JiTT's goals with simple technology and preparation on the fly, and to consider strengths and limitations of the approach, particularly for new faculty. My experience has been very positive: classes have been fun, engaging, and conversational. Students have reported that they come to class better prepared and appreciate the opportunity to ask and discuss questions before class. Where others have warned of the high workload with this approach, my experience is that the workload is reasonable compared to preparing a new course from scratch; the approach discourages some types of overpreparation. For these reasons, I would recommend the approach for other new instructors.
Detection of Risk Factors as Temporal Data Mining
Authors: Shoji Hirano, Shusaku Tsumoto
Venue: New Frontiers in Applied Data Mining: PAKDD 2008 International Workshops, Osaka, Japan, May 20-23, 2008. Revised Selected Papers (2009)

Hosptial information system (HIS) collects all the data from all the branches of departments in a hospital, including laboratory tests,physiological tests, electronic patient records. Thus, HIS can be viewed as a large heterogenous database, which stores chronological changes in patients' status. In this paper, we applied trajectory mining method to the data extracted from HIS. Experimental results demonstrated that the method could find the groups of trajectories which reflects temporal covariance of laboratory examinations.
The Complete Idiot's Guide to Canon EOS Digital Cameras
Authors: Erik Sherman
Venue:  (2007)

Smile and sayCanon EOS! This guide has everything you need to learn about Canon EOS camerasquickly. With a full- color photo insert and illustrated diagrams, this comprehensive guide fits inside a camera bag but is packed with information on every feature and setting; exposure, aperture, shutter speed, and depth of field; maximizing lighting and creating different effects; choosing the best lenses; converting RAW images, editing, printing, and much more. --The most complete and up-to-date coverage of the Canon EOS line, with a higher page count and a lower price than the competitors --Features information on the most popular Canon EOS cameras as well as basic digital photography advice --Provides information on producing the best-quality photos through digital editing --Includes a full-color insert that illustrates the capabilities of the Canon EOS line
A Model of Computation for Bit-Level Concurrent Computing and Programming: APEC
Authors: Takashi Ajiro, Kensei Tsuchida
Venue: IEICE - Transactions on Information and Systems (2008)

A concurrent model of computation and a language based on the model for bit-level operation are useful for developing asynchronous and concurrent programs compositionally, which frequently use bit-level operations. Some examples are programs for video games, hardware emulation (including virtual machines), and signal processing. However, few models and languages are optimized and oriented to bit-level concurrent computation. We previously developed a visual programming language called A-BITS for bit-level concurrent programming. The language is based on a dataflow-like model that computes using processes that provide serial bit-level operations and FIFO buffers connected to them. It can express bit-level computation naturally and develop compositionally. We then devised a concurrent computation model called APEC (Asynchronous Program Elements Connection) for bit-level concurrent computation. This model enables precise and formal expression of the process of computation, and a notion of primitive program elements for controlling and operating can be expressed synthetically. Specifically, the model is based on a notion of uniform primitive processes, called primitives, that have three terminals and four ordered rules at most, as well as on bidirectional communication using vehicles called carriers. A new notion is that a carrier moving between two terminals can briefly express some kinds of computation such as synchronization and bidirectional communication. The model's properties make it most applicable to bit-level computation compositionally, since the uniform computation elements are enough to develop components that have practical functionality. Through future application of the model, our research may enable further research on a base model of fine-grain parallel computer architecture, since the model is suitable for expressing massive concurrency by a network of primitives.