ppxscal/embedding_network huggingface dataset:
Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time
Authors: Jorge M. S. Valente, Rui A. F. S. Alves
Venue: Computers and Industrial Engineering (2005)

In this paper, we present filtered and recovering beam search algorithms for the single machine earliness/tardiness scheduling problem with no idle time, and compare them with existing neighbourhood search and dispatch rule heuristics. Filtering procedures using both priority evaluation functions and problem-specific properties have been considered. The computational results show that the recovering beam search algorithms outperform their filtered counterparts, while the priority-based filtering procedure proves superior to the rules-based alternative. The best solutions are given by the neighbourhood search algorithm, but this procedure is computationally intensive and can only be applied to small or medium size instances. The recovering beam search heuristic provides results that are close in solution quality and is significantly faster, so it can be used to solve even large problems.
Reusable assessment objects for learning management systems
Authors: Karsten Henke
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

This paper describes a Web-based Test, Examination and Assessment system that can be used via the Internet and is therefore suitable for both local and remote examination preparation as well as examination within a lab course (entry test). This solution is also intended for the use in lectures dealing with the design of complex digital control systems within the newly created European Master Degree Program "Remote Engineering". Actual Learning Management Systems (LMS) include mainly tools for authoring multiple choice or cloze questions and the like and use very simple assessment mechanisms. We also describe web-based scenarios to assess higher levels of knowledge (especially for high-level courses).
Group CRM: a new telecom CRM framework from social network perspective
Authors: Bin Wu, Qi Ye, Shengqi Yang, Bai Wang
Venue: Proceeding of the 1st ACM international workshop on Complex networks meet information & knowledge management (2009)

The structure of customer communication network provides us a natural way to understand customers' relationships. Traditional customer relationship management (CRM) methods focus on various customer profitability models, and they are short of ways to understand the social interactions. Graph mining and social network analysis provide ways to understand the relationships between customers, and there are already a few applications in CRM using these methods. To transform the traditional CRM methods from individuals to social groups, we propose a novel technical framework (GCRM) to manage the social groups in massive telecom call graphs. Our framework is based on a series of newly emerged methods for social network analysis, such as group detecting, group evolution tracking and group life-cycle modeling in telecom applications. We analyze the relationships between social groups and propose a method to find potential customers in these groups. To evaluate GCRM, we present a comprehensive study to explore the group evolutions in real-world massive telecom call graphs. Empirical results show that by taking this framework, analysts can gain deeper insights into the communication patterns of social groups and their evolutionary patterns which makes the management of these social groups much easier in real-world telecom applications.
Interactive exploration of tensor fields in geosciences using volume rendering
Authors: Björn Zehner
Venue: Computers Geosciences (2006)

Volume rendering methods enable the user to explore interactively scalar data on regularly spaced three-dimensional grids. This article discusses how to use this method to explore and analyse three-dimensional tensor fields. The proposed visualization makes use of the programmability of modern graphics hardware and of ''Line Integral Convolution'', a texture-based technique for the visualization of vector fields. While an example from geomechanics is used for presentation purposes, the rendering methods introduced are generic and would suit other application areas that involve volumetric data with several attributes equally well.
Effects of non-identical rayleigh fading on differential unitary space-time modulation
Authors: Meixia Tao
Venue: IEEE Transactions on Communications (2009)

Non-identical fading distribution in a multiple-input multiple-output (MIMO) channel, including unequal average channel gains and fade rates, often occurs when antennas are not co-located. In this paper, we present an analytical study of the effects of non-identical Rayleigh fading on the error performance of differential unitary space-time modulation (DUSTM). The fading processes for different transmit-receive antenna pairs are assumed to be independent and time-variant. We find that the maximum-likelihood (ML) differential detector of DUSTM over such channels is involved except for differential cyclic group codes. The conventional detector is proved to be asymptotically optimal in the limit of high signal-to-noise ratio (SNR) over static fading channels. Applying the distribution of quadratic forms of Gaussian vectors, we then derive closed-form expressions for the exact error probabilities of two specific unitary classes, namely, cyclic group codes and orthogonal codes. Simple and useful asymptotic bounds on error probabilities are also obtained. Our analysis leads to the following general findings: (1) equal power allocation is asymptotically optimal, and (2) non-identical channel gain distribution degrades the error performance. Finally, we also introduce a water-filling based power allocation to exploit the transmit non-identical fading statistics.
Latency-differentiable start-time fair queuing
Authors: Tae Joon Kim
Venue: Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications (2007)

Fair queuing algorithms providing Quality-of-Service (QoS) guarantees can be classified into two design methods in terms of the reference time used in calculating the timestamp of arriving packet: Start-Time (ST) and Finish-Time (FT). It was known that the former, even though yielding better bandwidth utilization, does not satisfy the requirements of isolating flows and providing differentiated QoS guarantees, while the latter is still suffering from a poor utilization. This paper proposes a ST-based algorithm satisfying those requirements, called Latency-Differentiable Start-time Fair Queuing (LDSFQ), in which the architecture of multiple ST servers in parallel is introduced. The evaluation results show that the LDSFQ scheduler yields better bandwidth utilization by up to 45% than that in the FT one under a practical internet phone scenario.
2-Layered SOA Test Framework Based on BPA-Simulated Event
Authors: Youngkon Lee
Venue: Proceedings of the 2009 Fifth International Joint Conference on INC, IMS and IDC (2009)

This paper presents an implementation case study for business-centric SOA test framework. The reference architecture of SOA system is usually layered: business process layer, service layer, and computing resource layer. In the architecture, there are so many subsystems to affect system performance, moreover they relate with each other. As a result, in the respect of overall performance, it is usually meaningless to measure each subsystem’s performance separately. In SOA system, the performance of the business process layer with which users keep in contact depends on the summation of the performance of the other lower layers. Therefore, measuring performance of the business layer includes indirect measurement of the other SOA system layers. We devised a business-centric SOA test framework in which activities and control primitives in business process managers are simulated to invoke commands or services in a test scenario. That is, in the test framework, a real business process scenario can be replaced to a mimicked business process test scenario, which is executed in a test proxy based on event mechanism. In this paper, we present the concept of BPA simulation, 2-layered test suites model, and reference architecture.
Scaling LC oscillators in nanometer CMOS technologies to a smaller area but with constant performance
Authors: Shih-An Yu, Peter R. Kinget
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

We present an oscillator design method that reduces the area of LC oscillators in extremely scaled CMOS technologies by taking advantage of the high fT of the transistors. The oscillator is scaled to operate at a higher frequency and is followed by a fixed-ratio divider. It maintains the same power consumption and performance for a given wanted output frequency while occupying a much smaller area. In principle, by scaling up the oscillation frequency N times, a factor of 1/N2 can be obtained in inductor area reduction. Simulated results show that with uniformly scaled inductors, the figure of merit (FoM) of the scaled oscillators at 1, 2,4, and 8 GHz can be within a 1-dB difference, whereas the figure of merit normalized for area (FoMA) improves with the oscillation frequency.
Multi-neighbor random key pre-distribution: a probabilistic analysis
Authors: Wei-Shou Li, Tung-Shih Su, Wen-Shyong Hsieh
Venue: IEEE Communications Letters (2009)

In this study, to obtain stronger connectivity, we propose and analyze a scheme extended by random key predistribution (RKP), which can work only in highly dense networks and require path construction. We propose a multineighbor random key pre-distribution scheme that releases these strong constraints. Accordingly, an establishment protocol and a probabilistic analysis in terms of dependency overhead are presented. We have made use of the measure of dependence to derive the exact value of the key connectivity probability.
Power allocation in the high SNR regime for a multicast cell with regenerative network coding
Authors: Jun Li, Wen Chen
Venue: IEEE Communications Letters (2009)

This letter focuses on power allocation schemes for a basic multicast cell with wireless regenerative network coding (RNC). In RNC, mixed signals received from the two sources are jointly decoded by the relay where decoded symbols are superposed in either the complex field (RCNC) or Galois field (RGNC) before being retransmitted. We deduce the optimal statistical channels state information (CSI) based power allocation and give a comparison between the two RNCs. When instantaneous CSI is available at each transmitter, we propose a suboptimal power allocation for RCNC, which achieves better performance.
High Efficiency Real Time Rendering for Point-Based Model on GPU
Authors: Dongjin Huang, Jianliang Lan, Wu Liu, Youdong Ding
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

In the last years the increasing programmability of GPU lead to lots of point-based rendering could be implemented on GPU, which not only let CPU to be available for other tasks, but also improve the execution speed through GPU. However, since the recent GPU does not support the epsilon-z-buffering algorithm, a majority of GPU based rendering algorithms are based on multi-pass rendering to achieve high visual quality. These approaches need to rasterize lots of possibly visible splats in the first and second pass, and implement lots of computations on these possibly visible splats in the pixel shader in the second pass. In this paper we propose an improved algorithm of multi-pass rendering based on modern GPU. Comparing with the existing multi-pass methods, our approach could acquire all visible splats after rasterization and depth test in the first pass. Then, we only rasterize and per-pixel compute these visible splats in the second pass, which effectively avoid unnecessary shading computations. Experiment results show that this algorithm could greatly improve the rendering efficiency and achieve the visual quality comparable to the previous algorithms. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
West Antarctic balance calculations: Impact of flux-routing algorithm, smoothing algorithm and topography
Authors: Anne M Le Brocq, Antony J Payne, Martin J Siegert
Venue: Computers Geosciences (2006)

Balance flux and velocity calculations are important in understanding the large-scale dynamics of ice masses and their state of balance. However the grid-based (finite difference) nature of the current algorithms means that there is a variety of ways in which the balance flux and velocity can be calculated. The flux-routing algorithm, grid orientation and grid size all have an impact on the balance calculations. Previous work has relied on the assumption that the ice flow direction is orthogonal to the surface contours, with the surface having been smoothed to incorporate a representation of the longitudinal stresses within the ice. This assumption is a simplification of the gravitational driving stress equation, which relates the driving stress to the gradient of the surface slope and the ice thickness. Further, the common representation of longitudinal stresses using a fixed size smoothing filter is a simplification of the theoretical treatment of longitudinal stresses by Kamb, B., Echelmeyer, K.A. [1986. Stress-gradient coupling in glacier flow: 1. longitudinal averaging of the influence of ice thickness and surface slope. Journal of Glaciology 32 (111), 267-298]. This study investigates the sensitivity of the balance calculations to these issues, using the West Antarctic Ice Sheet as a case study. Significant differences in both ice stream margins and values of ice flux within them result from the algorithm choice, gridorientation and gridsize. The inclusion of a theoretically appropriate smoothing approach improves the coherence of the pattern of ice flow. The incorporation of gravitational driving stress has a small effect in comparison to practical issues such as the grid orientation and size. As higher resolution datasets (less than 5km) become available for many ice masses, there is a temptation to calculate the balance flux using the same algorithms on the finer grids. The results shown in this study suggest that the type of algorithm most commonly used is not suitable for these finer grids. The impact of the practical issues described here encourages caution in the use of grid-based balance distributions and values, especially when considering the state of balance of individual ice streams.
The game of life on a hyperbolic domain
Authors: Clifford A. Reiter
Venue: Computers and Graphics (1997)

Classic 2-D outer totalistic automata such as Conway's Game of Life can be generalized to any domain of cells where each cell has eight neighbors. A circular hyperbolic arrangement of cells is described where each cell has eight neighbors and the time evolution of these hyperbolic automata are visualized in three dimensions. Both random and symmetric initial conditions are investigated using these techniques leading to insight into typical long term behavior and examples of symmetry breaking.
The Design and Realization of the Intelligentized Online Testing System Based on Templates
Authors: JunJie Zhang, WenBo Fang, Jian Song
Venue: Proceedings of the 2009 Second International Symposium on Knowledge Acquisition and Modeling - Volume 03 (2009)

This article introduces the design and realization process of intelligentized online testing system based on templates. The biggest difference between this system and the traditional online testing system is: there is no item bank in this system, and all of the test questions are generated from the testing templates, and every template can generate endless test questions, which are of the same knowledge and of the same difficult. The testing questions can effectively avoid the repetition of the test questions, it has reduced the accidental factors in the examination to the maximum extent, and the practical application prospects of the system are very good.
Power and rate control with outage constraints in CDMA wireless networks
Authors: C. Fischione, M. Butussi, K. H. Johansson, M. D’Angelo
Venue: IEEE Transactions on Communications (2009)

A radio power control strategy to achieve maximum throughput for the up-link of CDMA wireless systems with variable spreading factor is investigated. The system model includes slow and fast fading, rake receiver, and multi-access interference caused by users with heterogeneous data sources. The quality of the communication is expressed in terms of outage probability, while the throughput is defined as the sum of the users' transmit rates. The outage probability is accounted for by resorting to a lognormal approximation. A mixed integer-real optimization problem P1, where the objective function is the throughput under outage probability constraints, is investigated. Problem P1 is solved in two steps: firstly, we propose a modified problem P2 to provide feasible solutions, and then the optimal solution is obtained with an efficient branch-and-bound search. Numerical results are presented and discussed to assess the validity of our approach.
A distributed virtual lab: for practical activities in electronics
Authors: Jean-Pierre Gerval, Yann Le Ru
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

This paper sets out a distributed virtual reality application intended to practical activities in electronics: circuit design and simulation. The distributed virtual environment offers virtual components and devices (resistors, capacitors, transistors, generators and oscilloscopes) described in a standard Virtual Reality Modeling Language (VRML) format. Users are enabled to choose components and build a circuit. The simulation of the circuit is done using the SPICE programme that is a general-purpose circuit simulation programme for non-linear dc, non-linear transient, and linear ac analyses. The implementation is based on VRML and Java as languages and Cortona VRML plug-in from ParallelGraphics. The distribution of virtual worlds is obtained using DeepMatrix as environment server.
Study of stress waves in geomedia and effect of a soil cover layer on wave attenuation using a 1-D finite-difference method
Authors: Zhi-liang Wang, Yong-chi Li, J. G. Wang
Venue: Computers Geosciences (2006)

The propagation and attenuation of blast-induced stress waves differs between geomedia such as rock or soil mass. This paper numerically studies the propagation and attenuation of blast-induced elastoplastic waves in deep geomedia by using a one-dimensional (1-D) finite-difference code. Firstly, the elastoplastic Cap models for rock and soil masses are introduced into the governing equations of spherical wave motion and a FORTRAN code based on the finite difference method is developed. Secondly, an underground spherical blast is simulated with this code and verified by software, RENEWTO. The propagation of stress-waves in rock and soil masses is numerically investigated, respectively. Finally, the effect of a soil cover layer on the attenuation of stress waves in the rear rock mass is studied. It is determined that large plastic deformation of geomedia can effectively dissipate the energy of stress-waves inward and the developed 1-D finite difference code coupled with elastoplastic Cap models is convenient and effective in the numerical simulations for underground spherical explosion.
A sequential indicator simulation program for categorical variables with point and block data: BlockSIS
Authors: Clayton V. Deutsch
Venue: Computers Geosciences (2006)

Stochastic simulation of facies or geologic units is important before the assignment of continuous rock properties. Sequential indicator simulation (SIS) remains a reasonable approach when there are no clear genetic shapes that could be put into object-based modeling. Constraining SIS to soft secondary data coming from geological interpretation or geophysical measurements is important. There are a number of techniques including indicator kriging (IK) with a local mean, collocated cokriging, Bayesian updating, permanence of ratios, block kriging and block cokriging. BlockSIS implements all of these and more (nine all together). The images may also be cleaned using maximum a -posteriori selection.
Improved global stability conditions of the tuning parameter in FAST TCP
Authors: Yun Jong Choi, Jeong Wan Ko, Sung Wook Yun, PooGyeon Park
Venue: IEEE Communications Letters (2009)

In this letter, we present a correction of the theorem for the global stability of FAST TCP developed by Koo et al. in 2008. Furthermore, an analysis is carried out to determine an improved parameter condition for global stability than the existing conditions in the literature. The parameter condition is verified by the ns-2 simulation.
Physical Learning Activities with a Teaching Assistant Robot in Elementary School Music Class
Authors: Jeong-Hye Han, Dong-Ho Kim, Jong-Won Kim
Venue: Proceedings of the 2009 Fifth International Joint Conference on INC, IMS and IDC (2009)

Very recently, together with ICT (Information Communication and Technology) as teaching aids, the blended-learning combined with off-line education and e-learning has been administered. In the future, however, r-learning based on robots as teaching assistants will be employed to help students enhance their educational motivation and effects. Also, the teachers who have high- qualified capacity of ICT have also assumed robots as their assistants in the various fields such as music and language. Thus, many studies have investigated whether there are significant differences between the use of robots and other educational approaches in the field of education. However, there are few previous studies about whether robots would help music lessons or not in the field of music education. Therefore, the present study investigated whether Tiro, a teaching assistant robot, could help the Korean elementary school 4th-grade students learn six-eight time conduct in the music class. For treatments, teaching scenario for Tiro’s experimental lessons was designed. It consists of learning materials and class management services. Also, after the contents for flash-based multimedia robot were designed and developed, the final scenario for teaching assistant robot was created by adding robot action scripts in order to match the contents with robot action template. The contents of the assistant robot for music conduct lesson were downloaded by the wireless, and they were employed for this study. Data collected from Tiro’s experimental music lesson and the teacher’s assessment and feedback were analyzed and reported.
Dense texture-based visualization of unsteady and multi-variate vector fields
Authors: Francesca Taponecco
Venue: Computers and Graphics (2006)

We propose a novel technique that allows producing dense smooth visualization of unsteady vector fields. The suggested algorithm is texture-based: the field, which may depend on various quantities, such as time, determines how a chosen basic pattern of a texture has to be transformed and adapted to locally represent the features and variation of the field. Texture synthesis methods that aim at generating globally smooth textures yield dense visualizations of the vector field. Extending this synthesis in time leads to texture-based animations with frame-to-frame coherence. This approach is general and produces unsteady field visualizations in an intuitive and straightforward way. Additional degrees of freedom offer ways for user intervention (e.g. filtering and blending) or taking into consideration perception issues. This also makes this methodology useful and adaptable for a broad range of applications.