ppxscal/embedding_network huggingface dataset:
Smart merging strategy for configuring power saving parameters in IEEE 802.16 mobile WMANs
Authors: Shiann-Tsong Sheu, Chih-Cheng Yang, Hsu Wu-Hsiao, Youn-Tai Lee, Shao-Jung Lu
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

The IEEE 802.16e mobile wireless metropolitan area network (WMAN) standard is an emerging technology to support roaming mobility for mobile stations (MSs) in outdoor environment. Because most of MSs are powered by batteries, the standard supports three power saving modes to conserve battery power meanwhile, the different requirements of quality of services are guaranteed. By setting appropriate parameters, single type of power saving mode will work well for prolonging battery life. However, if an MS has established several connections with serving BS and these connections are associated with different power saving types, the sleeping behavior of MS might not follow the parameter settings because MS actually enters sleep mode only when all the connections of it are assigned to sleep at the same time. In other words, if there is any connection is in active mode or listening mode during a time frame, then the MS shall not turn down the wireless transceiver. Consequently, the power saving efficiency is degraded by such synchronizations. In order to minimize the power consumptions in MSs, this paper proposes a smart parameter merging strategy (PMS) for the base station (BS) to configure the parameters of power saving classes for MSs with multiple connections. The simulation results show that the proposed strategy has better performance of both the power consumption and the packet access delay compared to the standard strategy.
Bitmask-based control word compression for NISC architectures
Authors: Chetan Murthy, Prabhat Mishra
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Implementing a custom hardware is not always feasible due to cost and time considerations. No instruction set computer (NISC) architecture is one of the promising direction to design a custom datapath for each application using its execution characteristics. A major challenge with NISC control word is that they tend to be at least 4 to 5 times larger than regular instruction size, thereby imposing higher memory requirement. A promising approach is to compress these control words to reduce the code size of the application. This article proposes an efficient bitmask-based compression technique to drastically reduce the control word size while keeping the decompression overhead minimal. The main contributions of our approach are: i) efficient don't care resolution for maximum bitmask coverage using limited dictionary entries, ii) run length encoding to significantly reduce repetitive control words, and iii) smart encoding of constant and less frequently changing bits. Our experimental results demonstrate that our approach improves compression efficiency by an average of 20% over the best known control word compression, giving a compression ratio of 25% to 35%.
Using Context Information for Tailoring Multimedia Services to User's Resources
Authors: José M. Oliveira, Eurico M. Carrapatoso
Venue: Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services (2008)

The integration of multiple network access technologies in the terminal is one of the most important trends in 4G networks. This integration places telecommunications service providers, and in particular operators, under the significant challenge of being able to transform their services in order to adapt them to a great variety of delivery contexts. This paper describes a generic methodology for the adaptation of telecommunications services provided in the context of an operator. A number of scenarios are examined which show how Parlay middleware can be used by trusted service providers to easily access network resources and context information for enhancing location-based and adaptable multimedia telecommunications services.
Estimation of pose parameters from a set of least square objective functions
Authors: S. Hati
Venue: Machine Graphics Vision International Journal (2008)

In this paper, we have attempted to solve the pose estimation problem for a 3-dimensional object by independently estimating the pose parameters through the minimization of a set of objective functions, using Gauss approximation techniques for least squares optimization. In our implementation, the 3-D object is assumed to have three degrees of freedom on a flat surface, which is typical of automated visual inspection applications. However, the solution can be also extended to greater degrees of freedom. We have is shown that the pose can be estimated by only considering the x-coordinates of the known vertices in the projected space, but the same is not true if we consider the y-coordinates alone. We propose a set of modified objective functions from which it is possible to find the pose parameters. The parameters have been determined in noisy conditions under 20-dB and 40-dB SNR values and the robustness of the estimators is confirmed.
Automatic Detection of Learner's Affect From Gross Body Language
Authors: Sidney D'Mello, Art Graesser
Venue: Applied Artificial Intelligence (2009)

We explored the reliability of detecting learners' affect by monitoring their gross body language (body position and arousal) during interactions with an intelligent tutoring system called AutoTutor. Training and validation data on affective states were collected in a learning session with AutoTutor, after which the learners' affective states (i.e., emotions) were rated by the learner, a peer, and two trained judges. An automated body pressure measurement system was used to capture the pressure exerted by the learner on the seat and back of a chair during the tutoring session. We extracted two sets of features from the pressure maps. The first set focused on the average pressure exerted, along with the magnitude and direction of changes in the pressure during emotional experiences. The second set of features monitored the spatial and temporal properties of naturally occurring pockets of pressure. We constructed five data sets that temporally integrated the affective judgments with the two sets of pressure features. The first four datasets corresponded to judgments of the learner, a peer, and two trained judges, whereas the final data set integrated judgments of the two trained judges. Machine-learning experiments yielded affect detection accuracies of 73%, 72%, 70%, 83%, and 74%, respectively (chance = 50%) in detecting boredom, confusion, delight, flow, and frustration, from neutral. Accuracies involving discriminations between two, three, four, and five affective states (excluding neutral) were 71%, 55%, 46%, and 40% with chance rates being 50%, 33%, 25%, and 20%, respectively.
Optical code processing and its application to photonic networks
Authors: Naoya Wada
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Recent progress of optical code processing technology is explained. Ultra-high speed time domain, spectral domain, hybrid domain, and multiple optical code processing deices and systems are shown. As application of these technologies, OCDMA-PON, OPS network, and Tera Hertz optical clock generation will be demonstrated.
A genetic algorithm to solve the storage space allocation problem in a container terminal
Authors: Mohammad Bazzazi, Nima Safaei, Nikbakhsh Javadian
Venue: Computers and Industrial Engineering (2009)

In this paper, an efficient genetic algorithm (GA) is presented to solve an extended storage space allocation problem (SSAP) in a container terminal. The SSAP is defined as the temporary allocation of the inbound/outbound containers to the storage blocks at each time period with aim of balancing the workload between blocks in order to minimize the storage/retrieval times of containers. An extended version of a SSAP proposed in the literature is considered in this paper in which the type of container affects on making the decision on the allocation of containers to the blocks. In real-world cases, there are different types (as well as different sizes) of containers consisting of several different goods such as regular, empty and refrigerated containers. The extended SSAP is solved by an efficient GA for real-sized instances. Because of existing the several equality constraints in the extended model, the implementation of the GA in order to quick and facilitate achieve to the feasible solutions is one of the outstanding advantages of this paper. The performance of the extended model and proposed GA is verified by a number of numerical examples.
The principle of minimum dissipated power and the minimum energetic principle- two general theorems of the linear electric and magnetic circuits in stationary regime
Authors: Horia Andrei, Fanica Spinei, Nicolae Jula
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

The use of the power functional in the analysis of the electric and magnetic circuits makes it possible to appreciate the equilibrium state attained in the circuit at a certain moment. In the present work, a power functional is built for a circuit in steady-state conditions and its limit is determined. It is shown that the minimum of this functional corresponds to the minimum dissipated power in the circuit. Some applications to electric circuits and magnetic are shown.
A Novel Simple Internet-Based System for Real Time Monitoring and Optimizing Home Mechanical Ventilation
Authors: Raffaele L. Dellaca', Alessandro Gobbi, Leonardo Govoni, Daniel Navajas, Antonio Pedotti, Ramon Farré
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

The dissemination of the available telemedicine systems for the optimization of home mechanical ventilation (HMV) is prevented by the need of complex infrastructures. We developed a device which, once connected to Internet through the mobile phone network, allows an authorized physician connected to Internet to monitor the ventilator signals and modify the settings in real-time without the need of external data servers. The system was evaluated during experiments performed by tele-controlling a mechanical ventilator in Barcelona from Milano. A bench study verified the reliability and robustness of the system while an in-vivo test showed that it was possible to monitor and tele-control the ventilator to maintain the oxygen saturation of a rat ventilated in Barcelona subjected to interventions. Given that the system avoids the need for any complex telemedicine architecture and allows an individual and independent ventilator tele-control, it can be a new helpful tool to optimize HMV.
Nonlinear Characterisation of Fronto-Normal Gait for Human Recognition
Authors: T. K. Lee, Mohammed Belkhatir, P. A. Lee, S. Sanei
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

We present a novel analysis of multimedia data that is useful in human computer interfacing. By analyzing the video content of humans walking towards a camera, we establish the nonlinear nature of fronto-normal human gait which motivates the use of nonlinear dynamical analysis used in chaos theory to analyze human gait. In doing so, we obtain features that may be used as a biometric which can be used for automatic identification of humans using computers. We apply this in a multi-biometric experiment to demonstrate its effectiveness.
A Novel Face Recognition Method Using Facial Landmarks
Authors: Srinivas Nagamalla, Bibhas Chandra Dhara
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper we have presented a novel approach for face recognition. The proposed method is based on the facial landmarks such as eyes, nose, lips etc. In this approach, first the probable position of these landmarks is located from the gradient image. Secondly, the template matching is employed over a region around the probable positions to detect exact location of the landmarks. Then, statistical and geometric features are extracted from these regions. To reduce the dimension of the feature vector PCA is employed. In this experiment to classify the images Mahalanobis distance is employed. The performance of the proposed method is tested on ORL database.
A new testability guided abstraction to solving bit-vector formula
Authors: Nannan He, Michael S. Hsiao
Venue: Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning (2008)

We present a new abstraction approach based on the concept of the under- and over-approximation to efficiently solve bit-vector formulae generated from software verification instances, which include intensive control structures. Our proposed approach applies two common testability metrics: controllability metric (CM) and observability metric (OM) for guiding the abstraction refinement procedure. We implement the under-approximation by enforcing constant constraints on a small set of single-bit variables that control the branch selection of some ITE nodes. Subsequently, each constructed under-approximate model includes only a subset of paths in the formula. We use CM and OM to build such models so that a counterexample can be obtained with little effort. If the under-approximate model is unsatisfiable, an over-approximate abstraction is obtained by refining along the paths included in the model. This is conducted by learning the relevant formula constraints using the UNSAT proof. So the verification can be conducted incrementally due to the path(s) based partition feature of our approach. We also use OM as a guide to heuristically and efficiently restore additional verification-relevant constraints during the iteration. The experimental results show a significant reduction of the solving time compared to state-of-the-art solvers for bit-vector arithmetic.
Design and capacity performance analysis of wireless mesh network
Authors: A. Ting, D. Chieng, T. Hodgkinson, S. Kawade
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

From the network operator's point of view, the high CAPEX/OPEX cost resulting from fixed/wired backhaul links can be inhibitive to successful deployment of broadband wireless services. The emerging wireless mesh network (WMN) technology is seen as one of the potential solutions which may reduce wired backhaul dependency through multihop transmission. Despite the advantages, many remain sceptical on WMN's network capacity and scalability performances particularly when the user density is high. This paper provides an insight on the best possible upper-bound capacity performance of WMN, taking into consideration three key design parameters namely 1) Percentage of wired backhaul points per network, 2) Mesh-to-Access Link-Rate Ratio (R) and 3) Number of radio interfaces per mesh node including hybrid radio options. These design options are compared and contrasted with different deployment densities. The results generally show that the higher the number of backhaul points, the higher the effective access capacity available to each user domain. Increasing the R and the number of radio per mesh node are two alternative means to push up the effective access capacity per user domain without increasing the number of wired backhaul points. This is most significant in multi radio system where about 80% of saving in backhaul points with R= 3 can be achieved compared to 100% backhauled case. It is also found that 50% saving in the number of backhaul points can be achieved with R&ge;2 for all radio options (except for the pure single radio case) in order to maintain effective access capacity close to full rate (1.0) per user domain.
Tone Adjustment of Underexposed Images Using Dynamic Range Remapping
Authors: Yanwen Guo, Xiaodong Xu
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

We present a new method for automatically adjusting the tonal values of underexposed digital images. We make the most of the dynamic range of digital images, and adjust the tonal values through dynamic range remapping, with a specifically defined tone mapping operator. The operator comprises two concatenate terms. The first one is a global operator that adjusts the tonal values of underexposed image with a linear scale transformation as well as a nonuniform intensity reduction function. The second one is a local operator used for noise suppression and detail enhancement. With such operator, tone values of underexposed images are faithfully adjusted. Meanwhile, noises are suppressed without introducing noticeable artifacts into resulting images. Our method runs with high efficiency. Experimental results demonstrate its effectiveness.
Incremental unknowns method based on the θ-scheme for time-dependent convection-diffusion equations
Authors: Lunji Song, Yujiang Wu
Venue: Mathematics and Computers in Simulation (2009)

A &theta;-scheme using two-level incremental unknowns is presented for solving time-dependent convection-diffusion equations in two-dimensional case. The IMG algorithm (Inertial Manifold-Multigrid algorithm) including the second-order incremental unknowns is convergent. The incremental unknowns method based on the &theta;-scheme needs a stability condition as 0 ≤ &theta; < 1/2 and is unconditionally stable as 1/2 ≤ &theta; ≤ 1. By the GMRES method in the iteration at each time step, numerical results of the convection-diffusion equations are investigated and confirm that oscillations can be controlled by the incremental unknowns method.
ACM: An Efficient Approach for Managing Shared Caches in Chip Multiprocessors
Authors: Mohammad Hammoud, Sangyeun Cho, Rami Melhem
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

This paper proposes and studies a hardware-based adaptive controlled migration strategy for managing distributed L2 caches in chip multiprocessors. Building on an area-efficient shared cache design, the proposed scheme dynamically migrates cache blocks to cache banks that best minimize the average L2 access latency. Cache blocks are continuously monitored and the locations of the optimal corresponding cache banks are predicted to effectively alleviate the impact of non-uniform cache access latency. By adopting migration alone without replication, the exclusiveness of cache blocks is maintained, thus further optimizing the cache miss rate. Simulation results using a full system simulator demonstrate that the proposed controlled migration scheme outperforms the shared caching strategy and compares favorably with previously proposed replication schemes.
Exploration of an e-learning model to foster critical thinking on basic science concepts during work placements
Authors: Bas A. de Leng, Diana H. J. M. Dolmans, Rijn Jöbsis, Arno M. M. Muijtjens, Cees P. M. van der Vleuten
Venue: Computers Education (2009)

We designed an e-learning model to promote critical thinking about basic science topics in online communities of students during work placements in higher education. To determine the effectiveness and efficiency of the model we explored the online discussions in two case studies. We evaluated the quantity of the interactions by looking at quantitative data of the discussion 'threads' and we evaluated the quality of the discussion by content analysis of the individual messages. Both the procedural facilitation of the discussion and the instrument for content analysis were based on Garrison's 'Practical Inquiry model of Cognitive Presence'. Furthermore, we explored the experiences of the students and moderators by interviewing them and we organised their perceptions using the framework of an activity system. On the basis of the quantitative and qualitative data we conclude that the e-learning model was successful in establishing a dialogue among a group of students and an expert during work placements at different locations. The 'Practical Inquiry model' was useful in facilitating a sustained on-topic discourse involving critical thinking. Although the amount of critical thinking was moderate, the results suggest ways to increase integration and resolution activities in the online discussions.
Distinct Paths for the Star Graph
Authors: Xiaolong Wu, Min He, Fei Wang, Jing Yang, Shahram Latifi
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In this paper, we investigate the properties of cycles for node representation in the star graph. Cycles can be in any order. The position for each symbol in the ordinary cycle is fixed and the ordinary cycle can not be nested into any other cycle. However, cyclic shift operations on symbols in a none-ordinary cycle are allowed and none-ordinary cycle can be nested into any other cycle. The number of distinct paths for the star graph is determined using the combinatorial analysis.
DYSTAL: nonnumeric applications of FORTRAN
Authors: James M. Sakoda
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

This paper presents an explanation of how FORTRAN was used to write a list-processing language, DYSTAL, which uses linear arrays rather than linked word lists. Three basic features are dynamic storage allocation, integer array names as pointers, and a seven-word head for each array.
DCT-based reversible data hiding scheme
Authors: Chia-Chen Lin, Pei-Feng Shiu
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

To enhance the hiding capacity of Chang et al.'s reversible DCT-based data hiding scheme, in this paper we propose another method called a layer-1 data embedding strategy. Our proposed layer-1 strategy considers some areas not used by Chang et al.'s scheme, which we call layer-2 data embedding. To achieve our objective, we applied Tian's pixel expansion method to design our layer-1 data embedding strategy. Experimental results confirm that the hiding capacity provided by combining our strategy with Chang et al.'s is higher than that provided by the Chang et al. approach alone. Moreover, the image quality of stego-images with our proposed scheme remains above 30 dB for most test images, which is better than the best image quality offered by Chang et al.'s scheme. Finally, the security and reversibility of Chang et al.'s scheme is unaffected when their layer-2 scheme is combined with our proposed layer-1 scheme.
A novel fault-tolerant execution model by using of mobile agents
Authors: Wenyu Qu, Masaru Kitsuregawa, Hong Shen, Zhiguang Shan
Venue: Journal of Network and Computer Applications (2009)

The exponential expansion of the Internet and the widespread popularity of the World Wide Web give a challenge to experts on reliable and secure system design, e.g., e-economy applications. New paradigms are on demand and mobile agent technology is one of the features. In this paper, we propose a fault-tolerance execution model by using of mobile agents, for the purpose of consistent and correct performance with a required function under stated conditions for a specified period of time. Failures are classified into two classes based on their intrinsic different effects on mobile agents. For each kind of failure, a specified handling method is adopted. The introduction of exceptional handling method allows performance improvements during mobile agents' execution. The behaviors of mobile agents are statistically analyzed through several key parameters, including the migration time from node to node, the life expectancy of mobile agents, and the population distribution of mobile agents, to evaluate the performance of our model. The analytical results give new theoretical insights to the fault-tolerant execution of mobile agents and show that our model outperforms the existing fault-tolerant models. Our model provides an effective way to improve the reliability of computer systems.