ppxscal/embedding_network huggingface dataset:
Delivering Services to Residential Appliances by Utilizing Remote Resource Awareness
Authors: Andreas Häber, Martin Gerdes, Frank Reichert, Andreas Fasbender, Ram Kumar
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Service providers are nowadays offering a variety of services, and in particular multimedia content delivery. Besides, consumer appliances are increasingly becoming digitalized including support for communication networks. However, it is difficult, and in many cases impossible, to use these services with standard consumer appliances, such as TV and media player devices. Rather, usage is often restricted so that they can only be accessed through web browsers from PCs, mobile phones and similar terminals. This is unfortunate, because dedicated consumer appliances are often better suited to handle the content and thereby give consumers a better experience. Within this paper, three design approaches that support such services are described and compared, along with a prototype that shows this concept.
A theory of structural stationarity in the &#x03c0;-Calculus
Authors: Roland Meyer
Venue: Acta Informatica (2009)

Automata-theoretic representations have proven useful in the automatic and exact analysis of computing systems. We propose a new semantical mapping of &#x03c0;-Calculus processes into place/transition Petri nets. Our translation exploits the connections created by restricted names and can yield finite nets even for processes with unbounded name and unbounded process creation. The property of structural stationarity characterises the processes mapped to finite nets. We provide exact conditions for structural stationarity using novel characteristic functions. As application of the theory, we identify a rich syntactic class of structurally stationary processes, called finite handler processes. Our Petri net translation facilitates the automatic verification of a case study modelled in this class.
Full Order Models and Simulation of Boost Converters Operating in DCM
Authors: Xin Cheng, Guang-jun Xie
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

State-space average-value modeling of pulse-width modulation (PWM) converters in continuous and discontinuous modes has received significant attention in the literature, and various models have been developed. This paper presents a new approach for generating the state-space average-value model. In the proposed methodology, the so-called duty-ratio constraint and the correction term are extracted numerically. The parasitic effects of circuit elements are really included based on state-space averaging. The model is implemented in Simulink and the transient response and open loop transfer functions are simulated. Numerical analyses and experimental measurements confirm that the new models are more accurate than previous models.
Cross-Layer Joint Optimization of FEC Channel Codes and Multiple Description Coding for Video Delivery over IEEE 802.11e Links
Authors: Simone Milani, Giancarlo Calvagno, Riccardo Bernardini, Pamela Zontone
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

The paper presents two cross-layer optimization strategies based on the IEEE 802.11e standard that enable a robust video transmission using adaptively Forward Error Correction (FEC) channel codes at transport layer and a Multiple Description Coding (MDC) architecture. The first approach estimates an array of correlation measures for the Group of Picture to be transmitted and classifies it using a vector quantizer. The most appropriate coding mode is selected according to the correlation class and the channel conditions obtained through a cross-layer signalling protocol. The second solution relies on a parametric model of the channel distortion based on the percentage of null quantized transform coefficients, which can be obtained during the coding operations. According to the state of the network, the optimization algorithm estimates the expected quality of the reconstructed sequence for each mode and chooses the best one. Experimental results show that both algorithms perform well with a small computational effort but different playout delays.
Objective Cluster Analysis in Value-Based Customer Segmentation Method
Authors: Hengjun Zhao, Changzheng He
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Clustering is popular used in customer value segmentation in business research. Compared with other clustering methods, the objective clustering analysis can automatically and objectively determine the number of clusters and find out the optimal clustering scheme. This investigation discussed the reasonable evaluation system of value-driven customer segmentation, identified customer behavior using a recency, frequency and monetary(RFM) index and customer basic properties as integrated variables, and then, presented a novel approach-objective clustering analysis that be used in value-based customer segmentation. The shortcoming of the extra criterion was appraised by its algorithm. The new criterion is followed and be used in segmentation. To demonstrate the efficiency of the proposed method, this work performs an empirical study of a standard datasets of a book club to segment its customers. The experimental results demonstrate that the proposed method can more effectively target clustering groups than the former one.
Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning
Authors: Adebayo Alabi, Jordi Castro
Venue: Computers and Operations Research (2009)

The integrated refinery-planning (IRP), an instrumental problem in the petroleum industry, is made of several subsystems, each of them involving a large number of decisions. Despite the complexity of the overall planning problem, this work presents a mathematical model of the refinery operations characterized by complete horizontal integration of subsystems from crude oil purchase through to product distribution. This is the main contribution from a modelling point of view. The IRP, with a planning horizon ranging from 2 to 300 days, results in a large-scale linear programming (LP) problem of up to one million constraints, 2.5 million variables and 59 millions of nonzeroes in the constraint matrix. Large instances become computationally challenging for generic state-of-the-art LP solvers, such as CPLEX. To avoid this drawback, after the identification of the nonzero structure of the constraints matrix, structure-exploiting techniques such as Dantzig-Wolfe and block coordinate-descent decomposition were applied to IRP. It was also observed that interior-point methods are far more efficient than simplex ones in large IRP instances. These were the main contributions from the optimization viewpoint. A set of realistic instances were dealt with generic algorithms and these two decomposition methods. In particular the block coordinate-descent heuristic, with a reverse order of the subsystems, appeared as a promising approach for very large integrated refinery problems, obtaining either the optimal or an approximate feasible solution in all the instances tested.
Microsoft Exchange Server 2007 For Dummies
Authors: John Paul Mueller
Venue: For Dummies (2008)

Microsoft Exchange Server 2007 was made to help you handle e-mail, meeting management, and other essential office services. Microsoft Exchange Server 2007 For Dummies helps you get a handle on Exchange Server. Pretty slick, huh?Heres the lowdown on installing and administering Microsoft Exchange Server 2007 and taking advantage of all the enhancements in Service Pack 1. With this handy guide, youll be able to maximize the security, reliability, and speed that Exchange Server 2007 provides.Assess your organizations needs to determine which edition of Exchange Server best meets them Explore what Exchange Server does, then plan, install, and configure it Consider how your users work with their mail and customize your set-up to facilitate their needs Learn to use the Exchange Management Console Use the new Exchange Server security features to protect e-mail from viruses, spam, phishing, and other threats Set up an offline address book, use templates, and develop custom forms Create settings for the most efficient interaction with clients, use multiple mailboxes, and view digital certificates Manage resource scheduling and interactive calendars Troubleshoot your configuration, perform regular maintenance, and be able to recover from mail-specific problems Monitor Exchange Server performance and maintain databases, mail flow, and peak performance Microsoft Exchange Server 2007 For Dummies gets you ready to exchange problems for solutions.
Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops
Authors: Hyun-Seon Choi, Dong-Ho Lee
Venue: Computers and Industrial Engineering (2009)

This paper considers a two-stage hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. Each job is processed through the two production stages in series, each of which has multiple identical parallel machines. The problem is to determine the allocation of jobs to the parallel machines as well as the sequence of the jobs assigned to each machine. To solve the problem, a branch and bound algorithm, which incorporates the methods to obtain the lower and upper bounds as well as the dominance properties to reduce the search space, is suggested that gives the optimal solutions. In addition, two-phase heuristic algorithms are suggested to obtain good solutions for large-size problems within a reasonable amount of computation time. To show the performances of the optimal and heuristic algorithms suggested in this paper, computational experiments are done on a number of randomly generated test problems, and the test results are reported.
On JPEG2000 Error Concealment Attacks
Authors: Thomas Stütz, Andreas Uhl
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

In this work, JPEG2000 error resilience options and error concealment strategies are discussed and evaluated. Error resilience options and error concealment strategies have been employed to mimic attacks against selective / partial JPEG2000 encryption schemes. Thus the security evaluation of these selective / partial encryption schemes relies on the proper working of the JPEG2000 error concealment. Recommendations for JPEG2000 encryption given in previous work have to be reassessed on the basis of our results. Improvements to the error concealment code of the JPEG2000 reference software JJ2000 are presented.
Mobile display-based manipulation: an intuitive and interactive technique for manipulating simple robots
Authors: Kazuhiro Hosoi, Vinh Ninh Dao, Akihiro Mori, Masanori Sugimoto
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

In this paper, we propose the Mobile Display-based Manipulation (MDM) technique for manipulating simple robots such as automated cleaning robots. By capturing images of robots with a camera-attached mobile display and moving it in a three-dimensional space, a user can easily and intuitively manipulate the robots. To verify the validity and effects of the MDM technique, we developed two prototype systems using a handheld display and a projection display. Issues to be investigated and lessons learned through the design and evaluations of the systems are discussed.
An examination of TIC-TAC-TOE like games
Authors: Robert C. Gammill
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

There is a class of games which resemble TIC-TAC-TOE. These are games where two players alternately put X's and O's into playing spaces, attempting to get n of their signs in a row. Well-known games of this class are TIC-TAC-TOE (3 X 3) and QUBIC (4 X 4 X 4). The boards of these games form squares, cubes and hypercubes with n playing positions on a side. We will speak of these games as nk TIC-TAC-TOE following Citrenbaum.
On supporting obstacle-free and sharing tree for information collection in WSNs
Authors: Chih-Yung Chang, Yu-Chieh Chen, Sheng-Wen Chang, Shih-Chun Kuo
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Constructing a share tree from sink node to a group of data source nodes can explore the potential of data aggregation in wireless sensor networks (WSNs). In literature, plenty of researches developing mechanisms to construct a share tree, however, most of them can not resist obstacles which might damage the constructed tree topology and thus block the data transmission. This paper proposes a disturbed mechanism, namely obstacle-free sharing tree reconstruction protocol (OFST), to locally repair the injured share tree so that the reconstructed share tree can resist obstacles and explore the data aggregation potential. For a given three disconnected sub-tree, the proposed OFST initially identifies the share region where all points in the region can play the role of share point for resisting the existed obstacle and exploring the data aggregation potential. Based on the concept of steiner point, a theoretical study on selecting the best share point from the share region is presented for connecting the three sub-trees. Simulation results reveal that the proposed OFST protocol can effectively overcome the obstacle and explore the data aggregation potential, and hence reduce the energy consumption and prolong the network lifetime of the WSN.
Collective Latent Dirichlet Allocation
Authors: Zhi-Yong Shen, Jun Sun, Yi-Dong Shen
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

In this paper, we propose a new variant of Latent Dirichlet Allocation (LDA): Collective LDA (C-LDA), for multiple corpora modeling. C-LDA combines multiple corpora during learning such that it can transfer knowledge from one corpus to another; meanwhile it keeps a discriminative node which represents the corpus ID to constrain the learned topics in each corpus. Compared with LDA locally applied to the target corpus, C-LDA results in refined topic-word distribution, while compared with applying LDA globally and straightforwardly to the combined corpus, C-LDA keeps each topic only for one corpus. We demonstrate that C-LDA has improved performance with these advantages by experiments on several benchmark document data sets.
Realization of Low Power High-Speed Channel Filters with Stringent Adjacent Channel Attenuation Specifications for Wireless Communication Receivers
Authors: Jimson Mathew, R. Mahesh, A.P. Vinod, Edmund M-K. Lai
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Finite impulse response (FIR) filtering is the most computationally intensive operation in the channelizer of a wireless communication receiver. Higher order FIR channel filters are needed in the channelizer to meet the stringent adjacent channel attenuation specifications of wireless communications standards. The computational cost of FIR filters is dominated by the complexity of the coefficient multipliers. Even though many methods for reducing the complexity of filter multipliers have been proposed in literature, these works focused on lower order filters. This paper presents a coefficient-partitioning-based binary subexpression elimination method for realizing low power FIR filters. We show that the FIR filters implemented using proposed method consume less power and achieve speed improvement compared to existing filter implementations. Design examples of the channel filters employed in the Digital Advanced Mobile Phone System (D-AMPS) and Personal Digital Cellular (PDC) receivers show that the proposed method achieved 23% average reductions of full adder and power consumption and 23.3% reduction of delay over the best existing method. Synthesis results show that the proposed method offers average area reduction of 8% and power reduction of 22% over the best known method in literature.
A rough set-based multiple criteria linear programming approach for the medical diagnosis and prognosis
Authors: Zhiwang Zhang, Yong Shi, Guangxia Gao
Venue: Expert Systems with Applications: An International Journal (2009)

It is well known that data mining is a process of discovering unknown, hidden information from a large amount of data, extracting valuable information, and using the information to make important business decisions. And data mining has been developed into a new information technology, including regression, decision tree, neural network, fuzzy set, rough set, and support vector machine. This paper puts forward a rough set-based multiple criteria linear programming (RS-MCLP) approach for solving classification problems in data mining. Firstly, we describe the basic theory and models of rough set and multiple criteria linear programming (MCLP) and analyse their characteristics and advantages in practical applications. Secondly, detailed analysis about their deficiencies are provided, respectively. However, because of the existing mutual complementarities between them, we put forward and build the RS-MCLP methods and models which sufficiently integrate their virtues and overcome the adverse factors simultaneously. In addition, we also develop and implement these algorithm and models in SAS and Windows system platforms. Finally, many experiments show that the RS-MCLP approach is prior to single MCLP model and other traditional classification methods in data mining, and remarkably improve the accuracy of medical diagnosis and prognosis simultaneously.
Identification of sport talents using a web-oriented expert system with a fuzzy module
Authors: Vladan Papić, Nenad Rogulj, Vladimir Pleština
Venue: Expert Systems with Applications: An International Journal (2009)

This paper presents a fuzzy expert system for scouting and evaluation of young sport talents. Based on the knowledge of several human sport experts, various motoric skills tests, morphologic characteristics measurements and functional tests are quantized according to their importance for a chosen set of sports. Obtained values are entered into the knowledge database along with the grades of the measured results for each test. Fuzzy logic is implemented in order to make the system more flexible and robust. The whole system is web-oriented, i.e. developed ASP.NET application is available to the internet users with a proper login and password. The developed expert system gives acceptability prediction and proposal of the most suitable sports for the person being tested. The output results of the system were evaluated by 4 experts, using real data collected during several years. Comparison is done between the sport proposed by our expert system and the actual outcome of the person's sports career. Also, the comparison of the expert system output and the human expert suggestions were done. All tests showed high reliability and accuracy of the developed system. Strengths, possibilities and future plans of the Sport Talent expert system are also discussed.
Does the stationary viscous flow around a circular cylinder exist for large Reynolds numbers? A numerical solution via variational imbedding
Authors: Christo I. Christov, Rossitza S. Marinova, Tchavdar T. Marinov
Venue: Journal of Computational and Applied Mathematics (2009)

We propose an approach to identifying the solutions of the steady incompressible Navier-Stokes equations for large Reynolds numbers. These cannot be obtained as initial-value problems for the unsteady system because of the instability of the latter. Our approach consists of replacing the original steady-state problem for the Navier-Stokes equations by a boundary-value problem for the Euler-Lagrange equations for minimization of the quadratic functional of the original equations. This technique is called Method of Variational Imbedding (MVI) and in this case it leads to a system of higher-order partial differential equations, which is solved by means of an operator-splitting method. As a featuring example we consider the classical flow around a circular cylinder which is known to lose stability as early as for Re=40. We find a stationary solution with recirculation zone for Reynolds numbers as large as Re=200. Thus, new information about the possible hybrid flow regimes is obtained.
Modeling and Evaluating Errors Due to Random Clock Shifts in Quantum-Dot Cellular Automata Circuits
Authors: Faizal Karim, Marco Ottavi, Hamidreza Hashempour, Vamsi Vankamamidi, Konrad Walus, André Ivanov, Fabrizio Lombardi
Venue: Journal of Electronic Testing: Theory and Applications (2009)

This paper analyzes the effect of random phase shifts in the underlying clock signals on the operation of several basic Quantum-dot Cellular Automata (QCA) building blocks. Such phase shifts can result from manufacturing variations or from uneven path lengths in the clocking network. We perform numerical simulations of basic building blocks using two different simulation engines available in the QCADesigner tool. We assume that the phase shifts are characterized by a Gaussian distribution with a mean value of $i \frac{\pi}{2}$ , where i is the clock number and a standard deviation, ¿, which is varied in each simulation. Our results indicate that the sensitivity of building blocks to phase shifts depends primarily on the layout while the reliability of all building blocks starts to drop once the standard deviation, ¿ exceeds 4°. A full adder was simulated to analyze the operation of a circuit featuring a combination of the building blocks considered here. Results are consistent with expectations and demonstrate that the carry output of the full adder is better able to withstand the phase shifts in the clocking network than the Sum output which features a larger combination of the simulated building blocks.
Dynamic reordering of alternatives for definite logic programs
Authors: Hai-Feng Guo, Gopal Gupta
Venue: Computer Languages, Systems and Structures (2009)

Due to their highly declarative nature and efficiency, tabled logic programming systems have been applied to solving many complex problems. Tabled logic programming is essential for extending traditional logic programming with tabled resolution. In this paper, we propose a new tabled resolution scheme, called dynamic reordering of alternatives (DRA) resolution, for definite logic programs. The scheme keeps track of the type of the subgoals during resolution; if the subgoal in the current resolvent is a variant of a former tabled subgoal, tabled answers are used to resolve the subgoal; otherwise, program clauses are used similar to SLD resolution. Program clauses leading to variant subgoals at runtime are dynamically reordered for further computation until the subgoals are completely evaluated. DRA resolution allows query evaluation to be performed in a depth-first, left-to-right traversal order similar to Prolog-typed SLD resolution, thus yielding a simple technique for incorporating tabled resolution in traditional logic programming systems. We show the correctness of DRA resolution.