ppxscal/embedding_network huggingface dataset:
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Authors: D. de Werra, M. Demange, B. Escoffier, J. Monnot, V. Th. Paschos
Venue: Discrete Applied Mathematics (2009)

We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-hard in planar graphs, even if they are triangle-free and their maximum degree is bounded above by 4. Then, we prove that min weighted node coloring is NP-hard in P"8-free bipartite graphs, but polynomial for P"5-free bipartite graphs. We next focus on approximability in general bipartite graphs and improve earlier approximation results by giving approximation ratios matching inapproximability bounds. We next deal with min weighted edge coloring in bipartite graphs. We show that this problem remains strongly NP-hard, even in the case where the input graph is both cubic and planar. Furthermore, we provide an inapproximability bound of 7/6-@e, for any @e>0 and we give an approximation algorithm with the same ratio. Finally, we show that min weighted node coloring in split graphs can be solved by a polynomial time approximation scheme.
A Linear Cost Function Model and its Application
Authors: Xiaorui Zhang
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

In this paper, we present a new motion feature, viz. MotionCurve, and an o(n) algorithm for video adaptation. This new feature is based on motion activity in each video frame. The motion activity in each frame is represented by a Pixel Change Map(PCM) [7, 6]. A variational filter is applied on the PCM sequence to remove the noise and smooth “motion curve” for video adaptation. In our framework, the video adaptation is formulated as an optimization problem. The adaptation cost between any pair of frames is defined as the result of integration along the motion curves. With this cost function, video adaptation becomes a problem of selecting the optimal set of frames such that the summation of the cost of jumps on the Motion Curve is minimal. Experimental results on various videos demonstrate the effectiveness of our proposed ”motion curve” feature.
Dynamic and On-Line Design Space Exploration for Reconfigurable Architectures
Authors: Fakhreddine Ghaffari, Michel Auguin, Mohamed Abid, Maher Ben Jemaa
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

The implementation of complex embedded applications requires a mix of processor cores and HW accelerators on a single chip. When designing such complex and heterogeneous System on Chip (SoCs), the HW/SW partitioning needs to be made prior to refining the system description. Traditional system partitioning is generally done at the early stage of system architecture, by defining the tasks to be implemented on the embedded processor(s), and the tasks to be implemented on the hardware. We describe here a new approach of On-line Partitioning Algorithm (OPA) which consists of adapting dynamically the architecture to the processing requirements. A scheduling heuristic is associated to this partitioning approach. We consider soft real time data flow graph oriented applications for which the execution time is dependent on the content of input data. The target architecture is composed of a generic processor connected to a dynamically reconfigurable hardware accelerator. The dynamic reconfiguration allows the self adaptation of the architecture which avoids redesigning a new architecture according to variation of characteristics of applications algorithms. We compare our method with an Off-line static HW/SW partitioning approach. We present results of the OPA on an image processing application. Our experiments included simulation results with SystemC for on-line scheduling and partitioning approaches. An ILP solver is used to compare the experiment results with an off-line static HW/SW partitioning approach.
LARMA: location-aided route maintenance algorithm for mobile ad-hoc networks
Authors: Yoo-seung Won, Jin-woo Hyun, Sang-Eon Kim, Jae-il Jung
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Most MANET (Mobile Ad-hoc Networks) routing protocol was focused on the route discovery phase more than route maintenance phase. Thus, most MANET routing protocol cannot cope with a route failure that is caused by movement of node efficiently. To solve the above problem, in this paper, we propose an algorithm that maintains a robust routing path using the position information of mobile nodes in the MANET. In LARMA (Location-Aided Route Maintenance Algorithm), we defined the warning zone as a region with a high probability of link disconnection between two nodes. Each node chooses an appropriate intermediate node that is not within the warning zone in order to prolong the lifetime of the routing path. We use the QualNet simulator to evaluate the performance of our proposals, and compare the LARMA which modifying the existing AODV routing protocol with AODV. The simulation results show that a performance improvement of the LARMA in comparison with AODV in terms of link lifetime.
The effects of CD-ROM storybook reading on Israeli children's early literacy as a function of age group and repeated reading
Authors: Ofra Korat
Venue: Education and Information Technologies (2009)

The effects of reading a CD-ROM storybook on children's early literacy were examined as a function of their age group and the number of times they used the software. The investigation was carried out on 214 children: 108 pre-kindergarten children (aged 4:2 to 5:3) and 106 kindergarten children (aged 5:3---6:4). This population included 107 girls and 107 boys. The children in each group were randomly assigned to one of three groups. The first intervention group was afforded three CD-ROM storybook reading sessions. The second group was afforded five reading sessions and the third group served as a control and was afforded the regular kindergarten program. Pre- and post-intervention early literacy measures included vocabulary, word recognition and phonological awareness. No age group differences were found between the children's early literacy progress after using the software and no interaction was found between age group and the number of reading sessions. Children from both age groups exhibited a similar level of story comprehension. Children who used the software five times exhibited greater progress in word meaning than those who used it three times and children in both of these groups did better than the control group. Children who used the software five times exhibited greater progress in word reading and phonological awareness than children in the control group. Implications for future research and education are discussed.
The application of RFID on inpatient medication administration to improve patient safety and reduce adverse drug events
Authors: Chun-Liang Lai, Shou-Wei Chien, Shiu-Ching Chen, Kwoting Fang
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

In developed countries as many as one in ten patients is harmed while receiving hospital care, estimates 1.4 million people worldwide suffer from infections acquired in hospitals, and approximate 380,000 to 450,000 preventable Adverse drug events (ADEs) occurring annually in the United States. Medical errors and ADEs could be prevented by building a safer healthcare system. Therefore, the aim of this article attempts to improve patient identification, and inpatient medications. Recently, Radio frequency identification (RFID) technology has been applied for patient identification, location monitor and alarm in hospital management. We developed the RFID on Inpatient Medication Administration System (RIMAS), integration with the Hospital Information Systems (HIS) and reengineer the inpatient medication processes to improve patient safety and reduce ADEs. The RIMAS system integrating RFID into the existing HIS to improve the efficiency of hospital management and patient safety, and decrease the risk of medication errors thereby increase higher quality of patient care.
An Algorithm-by-Blocks for SuperMatrix Band Cholesky Factorization
Authors: Gregorio Quintana-Ortí, Enrique S. Quintana-Ortí, Alfredo Remón, Robert A. Geijn
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

We pursue the scalable parallel implementation of the factor- ization of band matrices with medium to large bandwidth targeting SMP and multi-core architectures. Our approach decomposes the computation into a large number of fine-grained operations exposing a higher degree of parallelism. The SuperMatrix run-time system allows an out-of-order scheduling of operations that is transparent to the programmer. Exper- imental results for the Cholesky factorization of band matrices on two parallel platforms with sixteen processors demonstrate the scalability of the solution.
On reference model tracking for Markov jump systems
Authors: E. K. Boukas
Venue: International Journal of Systems Science (2009)

This article deals with the tracking problem for the Markov Jump systems with external finite energy disturbance. A state feedback controller that makes the state vector of the system track precisely a given state vector of a reference model is proposed. The tracking problem is formulated as an H∞ control problem and an approach to synthesise the state feedback controller that quadratically stabilises the augmented dynamics and at the same time rejects the external disturbance that is developed. This approach is based on the solution of some linear matrix inequalities. A numerical example is provided to show the usefulness of the developed results.
Slack-based global multiprocessor scheduling of aperiodic tasks in parallel embedded real-time systems
Authors: Lars Lundberg, Hakan Lennerstad
Venue: Proceedings of the 2008 IEEE/ACS International Conference on Computer Systems and Applications (2008)

We provide a constant time schedulability test and priority assignment algorithm for an on-line multiprocessor server handling aperiodic tasks. Dhall’s effect is avoided by dividing tasks in two priority classes based on their utilization: heavy and light. The improvement in this paper is due to assigning priority of light tasks based on slack - not on deadlines. We prove that if the load on the multiprocessor stays below (3 − √5) / 2 ≈ 38.197% , the server can accept an incoming aperiodic task and guarantee that the deadlines of all accepted tasks will be met. This is better than the current state-of-the-art algorithm where the priorities of light tasks are based on deadlines (the corresponding bound is in that case 35.425%).
Design of Spectrally Efficient Hermite Pulses for PSM UWB Communications
Authors: Alex Cartagena Gordillo, Ryuji Kohno
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we propose a method for designing a set of pulses whose spectrum is efficiently contained in amplitude and bandwidth. Because these pulses are derived from and have shapes that are either equal or similar to the Hermite pulses, we name our proposed transmit pulses as spectrally efficient Hermite pulses. Given that the proposed set of pulses does not constitute an orthonormal one, we also propose a set of receive templates which permit orthonormal detection of the incoming signals at the receiver. The importance of our proposal is in the potential implementation of M-ary pulse shape modulation systems, for ultra wideband communications, with sets of pulses that are efficiently contained within a specific bandwidth and limited to a certain amplitude.
Robust EMG pattern recognition to muscular fatigue effect for powered wheelchair control
Authors: Jae-Hoon Song, Jin-Woo Jung, Sang-Wan Lee, Zeungnam Bien
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2009)

The main goal of this paper is to design an electromyogram (EMG) pattern classifier which is robust against muscular fatigue effects for powered wheelchair control. When a user operates a powered wheelchair using EMG-based interface for a long time, muscular fatigue often arises from sustained duration of muscle contraction. The recognition rate thus is degraded and controlling wheelchair gets more difficult. In this paper, an important observation is addressed that the variations of feature values due to the effect of the muscular fatigue are consistent for sustained duration. Based on this observation, we design a robust pattern classifier through the adaptation process of hyperboxes of Fuzzy Min-Max Neural Network. We present, as a result, a significantly improved performance in terms of the continuous usage of wheelchair.
Creating private network overlays for high performance scientific computing
Authors: Edward Walker
Venue: Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware (2007)

In this paper we describe an approach in creating private network overlays in user-space to support the dynamic creation of personal clusters on-demand. These personal clusters are created by submitting job proxies to High Performance Computing (HPC) clusters. Job proxies contribute CPU resources back to the personal cluster when they eventually run, allowing application jobs to execute on them in a system call virtualized run-time environment. The virtualized run-time environment enables additional personal cluster-wide services to be interposed, including a private network overlay instantiated for each personal cluster created. The interposed private network overlay allows the personal clusters to tunnel IP traffic thorough gateway nodes at each contributing HPC cluster site in order to provision resources across private networks, survive transient network outages, support critical services like distributed filesystems, and in some cases, improve network transfer throughput across the wide-area network. This paper describes our design and implementation strategy, and concludes with some general guiding principles to aid other projects of a similar nature.
Applications of the PROPHET system in human clinical investigation
Authors: Bernard J. Ransil
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The study of chemical-biological interrelationships reaches its most challenging levels of complexity and difficulty in human clinical investigation. Whether the objective is development of a new drug, better understanding of an old one, or further elucidation of life processes which normally or pathologically distribute, transform, and eliminate exogenous and endogenous chemical substances, there is no experimental subject more important and more complex than man. And since no experimental subject is more difficult to study systematically than man, there probably is no area of biology and medicine where computer science and technology are needed more, but exploited less, than in human clinical investigation.
TOP-K projection queries for probabilistic business processes
Authors: Daniel Deutch, Tova Milo
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specifications are extremely valuable for companies. In particular, given a BP specification, identifying the top-k flows that are most likely to occur in practice, out of those satisfying a given query criteria, is crucial for various applications such as personalized advertizement and BP web-site design. This paper studies, for the first time, top-k query evaluation for queries with projection in this context. We analyze the complexity of the problem for different classes of distribution functions for the flows likelihood, and provide efficient (PTIME) algorithms whenever possible. Furthermore, we show an interesting application of our algorithms to the analysis of BP execution traces (logs), for recovering missing information about the run-time process behavior, that has not been recorded in the logs.
Small knowledge: a concept of enhanced bookmarks with personal context
Authors: Akiko Hino, Katsumi Tanaka
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

A concept named "Small Knowledge" is described in which the targets of bookmarks are portions of Web pages along with personal contexts. A simple browsing model is used to extract the personal context, and a personal context extraction algorithm preserves the personal association. A prototype implementing this concept works in a manner analogous to taking photographs.
Higher order weak epiderivatives and applications to duality and optimality conditions
Authors: C. R. Chen, S. J. Li, K. L. Teo
Venue: Computers Mathematics with Applications (2009)

In this paper, the notions of higher order weak contingent epiderivative and higher order weak adjacent epiderivative for a set-valued map are defined. By virtue of higher order weak adjacent (contingent) epiderivatives and Henig efficiency, we introduce a higher order Mond-Weir type dual problem and a higher order Wolfe type dual problem for a constrained set-valued optimization problem (SOP) and discuss the corresponding weak duality, strong duality and converse duality properties. We also establish higher order Kuhn-Tucker type necessary and sufficient optimality conditions for (SOP).
Modeling Usage: Techniques and Tools
Authors: Catharina Riedemann, Regine Freitag
Venue: IEEE Software (2009)

This review of four usage-modeling techniques clarifies key elements of each technique and their strengths and weaknesses from the perspective of usage-centered development. It also points to tools where appropriate. Finally, the authors argue for applying a template-supported use scenario integrating the three approaches.
Imaginary &middot; Numbers
Authors: Keiko Kimoto
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

In my creative process, I begin with a numerical formula as a universal language and then develop it into various media. As a result, I spend a great deal of time constituting the system. However, at this stage, there is hardly anything visual apart from small graphs.
Playing urban sustainability: the ecology of a simulation game
Authors: Nicole Podleschny
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

To date, methodologies used in the field of game studies are prolific while indistinct due to the multifaceted nature of the field. In particular, games that shape our understandings of political, social or cultural environments add a new dimension to the discussion and theorization of games and learning. As gameplay is increasingly understood as situated in cultural contexts and practices, this paper argues for a comprehensive approach to game studies by positioning games in a wider ecology of learning. The strength of an ecology approach is that it identifies the relations and heterogeneous agents that contribute to developing, shaping, and performing the learning opportunities of a game. This paper suggests a methodological approach of qualitative ethnographic participant observation. Adopting a case study approach as an appropriate research strategy, this ethnography specifically examines and participates in the simulation game SCAPE (Sustainability, Community And Planning Education), an urban sustainability education tool.
Design and Implementation of Communication Algorithm in NIOSII-Based RFID Reader
Authors: Chen Ying
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

RFID is a popular automatic identification technology currently, which will have large opportunities in the future. Communication algorithm is a key step for the design of RFID system. This paper propose design and implementation communication algorithm in software. There are many research activities in RFID hardware systems, but there is few in software infrastructure. In order to the implementation of this algorithm, we propose the RFID reader baseband design based on a new structure. This new structure is implemented NIOSII soft core in reader baseband FPGA. It design and implemente communication algorithm in NIOSII soft core. In this paper, the design of reader baseband and communication algorithm are described in detail. Finally, this paper presents the experimental verification communication algorithm and analysis of algorithm parameter Q. The experiment shows that our reader can communicate with multi-tags, and it operations communication algorithm are working correctly.
Simulation-based optimization of a complex mail transportation network
Authors: Anna Syberfeldt, Henrik Grimm, Amos Ng, Martin Andersson, Ingemar Karlsson
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The Swedish Postal Services receives and distributes over 22 million pieces of mail every day. Mail transportation takes place overnight by airplanes, trains, trucks, and cars in a transportation network comprising a huge number of possible routes. For testing and analysis of different transport solutions, a discrete-event simulation model of the transportation network has been developed. This paper describes the optimization of transport solutions using evolutionary algorithms coupled with the simulation model. The vast transportation network in combination with a large number of possible transportation configurations and conflicting optimization criteria make the optimization problem very challenging. A large number of simulation evaluations are needed before an acceptable solution is found, making the computational cost of the problem severe. To address this problem, a computationally cheap surrogate model is used to offload the optimization process.
Application of DEA in analyzing a bank's operating performance
Authors: Tyrone T. Lin, Chia-Chi Lee, Tsui-Fen Chiu
Venue: Expert Systems with Applications: An International Journal (2009)

This article takes 117 branches of a certain bank in Taiwan in 2006 as the research subject and introduces data envelopment analysis (DEA) to evaluate the operating performances of business units of this bank to provide the reference for a bank's managers in determining operation strategies. The result indicates that, in overall technical efficiency, the case bank has many inefficient branches distinctly; the average overall technical efficiency of branches is 54.8% and the average pure technical efficiency of branches is 67%, which is probably because of lower loan-to-deposit ratio, leading to excessive input waste. The average scale efficiency of the case bank during the sample period is 82%. The ratio of resource waste due to technical inefficiency is 45.2%, of which 55.03% is due to pure technical inefficiency.
An approach for the effective utilization of GP-GPUs in parallel combined simulation
Authors: David W. Bauer,  Jr., Matthew McMahon, Ernest H. Page
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

A major challenge in the field of Modeling & Simulation is providing efficient parallel computation for a variety of algorithms. Algorithms that are described easily and computed efficiently for continuous simulation, may be complex to describe and/or efficiently execute in a discrete event context, and vice-versa. Real-world models often employ multiple algorithms that are optimally defined in one approach or the other. Parallel combined simulation addresses this problem by allowing models to define algorithmic components across multiple paradigms. In this paper, we illustrate the performance of parallel combined simulation, where the continuous component is executed across multiple graphical processing units (GPU) and the discrete event component is executed across multiple central processing units (CPU).