ppxscal/embedding_network huggingface dataset:
Vision for 2020?
Authors: Werner Mohr
Venue: Wireless Personal Communications: An International Journal (2008)

Mobile and wireless communications provide today high global penetration especially for voice and lower rate data services. In future such systems will be applied in many different usage scenarios from mobile and stationary applications in different radio environments for different communication relations between humans and machines. Today different types of systems are being applied for different application areas. In future, systems and applications will be mainly designed from a user-centric perspective. The vision of future systems is based on an integration and cooperation of different cooperating access systems in a heterogeneous environment at a packet-based core network. ITU-R provided this vision and basic requirements already in 2003, which are the basis for the preparation of World Radiocommunication Conference (WRC 2007) for the potential identification of additional frequency spectrum. In addition, international bodies and communities developed general vision statements on the future development and identified the necessary research areas. Availability of sufficient frequency spectrum is an issue for systems especially with high user throughput versus Quality of Service requirements for full area coverage. Limitations in the availability of sufficient frequency spectrum for wideband communication may change the role models for operators and may potentially result in infrastructure sharing. In the last years huge research activities have been launched in Asia, Europe and North America, which were originally triggered by the ITU-R vision and are following a similar technical approach. There are also parallel activities ongoing in the global wireless IT sector for different application scenarios. These developments have also to consider economic trends and a parallel deployment of wideband fixed line systems. This will result in different scenarios such as Fixed-Mobile-Convergence (FMC) versus competition between operators for mobile and/or fixed line services. In addition, an increasing use of IP for voice and data communication has to be considered in future system design. With respect to the huge deployed infrastructure future developments are expected to evolve from existing and emerging systems. However, all players have also to be prepared for disruptive developments driven by new players. This paper will provide an overview on these different trends and developments towards future systems.
Higher-Order Transformations for Product Lines
Authors: Jon Oldevik, Oystein Haugen
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

An aspect-based extension to a text transformation language provides higher-order transformations that can be used to represent variability in generative product line engineering. We show by example how these higher-order transformations compare with first order transformations. We also detail how the approach has been implemented as an extension of MOFScript, an existing model-to-text transformation language.
AMBRA: automated model-based risk analysis
Authors: Marco D. Aime, Andrea Atzeni, Paolo C. Pomi
Venue: Proceedings of the 2007 ACM workshop on Quality of protection (2007)

Risk analysis is the starting baseline that helps to choose what technical and procedural security measures an organisation must employ. In spite of its importance, due to its complexity and its relative immaturity, this issue burdens on the arm of security experts at the moment, with little automation of the process. In this work, we show a methodology based on existing standards, highlighting tasks automatically-performable, and describe how it is possible to automate these aspects in our model.
Automated QoS policy adaptation for heterogeneous access network environments
Authors: Pedro A. Aranda Gutierrez, Ilka Miloucheva
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

To support QoS guarantee and resource usage in heterogeneous access network environments more efficiently (UMTS, WIMAX, WLAN DVB-T, DVB-H), there is the challenge of automated configuration and adaptation of policies for QoS-aware applications. A policy management architecture is required, which allows interaction and adaptation of QoS policies of different actors, such as network operator, service provider and user based on common a policy repository. This paper focusses on design issues of such an architecture including adaptation procedures, management interfaces for different actors, components for policy adaptation, as well as policy repository and data bases describing the QoS information for heterogeneous access networks.
A Service Level QoS Mechanism and Algorithm for Data Distribution and Backup in an Grid Based Astronomy Data Management System
Authors: Zhili Cheng, Zhihui Du, Suihui Zhu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Based on the research of SLA, SNAP, MetaService and Contractual Computing Service, a service level QoS mechanism and algorithm for astronomy data distribution and backup in grid environment is proposed. A weight based comparison method for different data services provided by data servers is described first. The method can choose suitable data servers under the requirements of consumers. Based on the weight based comparison method, a data distribution algorithm is designed and this algorithm can obtain an optimized data allocating solution with a time complexity of O(lg)xxnxy+ . In a practical example of data distribution and backup, the balancing mechanism is explained between two factors: the performance and the cost. The mechanism and the algorithm have been implemented in an astronomy data management prototype system. Compared to non-QoS guarantee scenario, a set of experiments with different weights of performance and cost have been tested and the results show that the QoS guarantee method can satisfy consumer's requirement effectively.
IR Image Based Eye Gaze Estimation
Authors: Dongshi Xia, Zongcai Ruan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In this paper, we present a novel approach to estimate the human's eye gaze from a single infrared spectrum image of two eyes. Observing that the pupil contour is a circle, we estimate the normal direction of this circle, considered as the eye gaze, from its elliptical image. By assuming that the two gaze vectors of both eyes and the vector which is determined by the two centers of the right and left pupil are coplanar, we can calculate the both eye gaze. Compared to most existing 3-D gaze estimation algorithms, our approach does not require those of face feature information such as the eye corners. Since the focal length can be calculated by our "Coplanar Constraint", ours does not need to know the exact focal length of the camera. The extensive experiments over simulated images and real images demonstrate the feasibility and the effectiveness of our method.
On Increasing Signal Integrity with Minimal Decap Insertion in Area-Array SoC Floorplan Design
Authors: Chao-Hung Lu, Hung-Ming Chen, Chien-Nan Jimmy Liu
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

With technology further scaling into deep submicron era, power supply noise become an important problem. Power supply noise problem is getting worse due to serious IR-drop and simultaneous switching noise, and decoupling capacitance (decap) insertion is commonly applied to alleviate the noise. There exist some approaches to addressing this issue, but they suffer either from over-design problem or late decap insertion during design stage. In this paper, we propose a methodology to insert decap in a more efficient and effective way during early design stage in area-array designs. The experimental results are encouraging. Compared with other approaches in [15] and [12], we have inserted enough decap to meet supply noise constraint while others employ more area.
Channel State Estimation and Scheduling Algorithms for Multi-Rate Wireless Systems
Authors: Sourav Pal, Sumantra Kundu, Amin R. Mazloom, Sajal K. Das
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Emerging multi-rate wireless systems both cellular (cdma2000, High Data Rate (HDR)) and Wi-Fi like systems demand that the currently used channel estimation and scheduling techniques be revisited. Not only the channel estimation, prediction algorithms, and protocols need to be modified, the premise for evaluating their performance needs to be changed. Current techniques comprise of scheduling algorithms based on existing channel state. We recommend that for enhanced performance in terms of user satisfaction and system throughput not only channel state but also the demand rate needed for satisfying the user needs to be considered. In this paper, we devise new mechanisms to estimate the varying channel conditions using information theoretic techniques for multi-rate wireless systems. We utilized a nonparametric estimator of Rényi's entropy using the Parzen windowing technique to estimate the probability density function of the channel rate variation as experienced by every user in the system. Scheduling algorithms are proposed based on the channel conditions estimated by the proposed technique as well as the data rate needed for satisfying each user . The proposed mechanism ensures the highest number of satisfied users by maintaining the stipulated QoS requirements and fairness amonst users. We also demonstrate that maximizing the throughput does not necessarily result in maximizing the number of satisfied users. Results demonstrate that the proposed estimation techniques perform better than existing schemes both in terms of number of satisfied user and throughput.
Motion picture production facility with liquid cooled 512 processor mobile super computing vehicle and virtual reality environment
Authors: Mark J. Prusten
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

The motion picture production pipeline has evolved where super computers are needed at the filming location. This allows content from digital cinema cameras recorded on external raid hard drives, shooting 4K-8K content, to have immediate processing capabilities. This Mobile Super Computing Vehicle, MSCV, will provide a mobile nervous center for a 6--8 man production crew. This announcement describes the Linux based liquid cooled 512 processors producing a 30 Teraflops super computer with 5 racks that will be integrated into a tractor trailer vehicle. The electrical, thermal, and mechanical engineering design issues of this undertaking will be analyzed and presented. The thermal issues are resolved by a closed chilled water system running through a unique design carries away up to 95 percent of the heat generated by the system. A complete Linux production pipeline tool set for digital intermediate processing and visual effects will be presented.
Towards a Real Time Charging Framework for Complex Applications in 3GPP IP Multimedia System (IMS) Environment
Authors: Hanane Oumina, Daniel Ranc
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

Real time charging is crucial to telecom operators who base their return on investment on this type of billing that still seems both attractive and fair to customers. In the context of the shift of network technology to the all-IP paradigm under the IMS umbrella, and the consequent revolution in terms of services, the concept of real-time charging evolved as well to tackle the challenges of multimedia services and packet switching technologies. However, IMS adds the notion of service composition by the service session concept that adds further complexity to the charging task. In order to handle this complexity, the present contribution suggests a framework to model applications and real-time charging policies according to involved services and their characteristics. Also, it introduces the concept of multi-definition of the single service in IMS charging paradigm.
An Application of a Large-Image Memory Graphics Workstation
Authors: Charles Wells, Vladimir Keene
Venue: IEEE Computer Graphics and Applications (1985)

One company solved its need for a workstation capable of 3-D plant design by creating its own highly interactive graphics hardware and software in a multiple-bus architecture.
Frame-Based Software Engineering
Authors: P. G. Bassett
Venue: IEEE Software (1987)

One of reusability's main problems is how to easily modify available components. This frame-based approach handles the problem. 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
A Mini-Based Banking System
Authors: N. Sugiura
Venue: Computer (1976)

In Japan, on-line banking systems were the first systems to offer computerized services on a full scale. Indeed, together with seat reservation systems, banking systems led the technological development of on-line data processing systems in this country. The reasons for this were much the same as those that prompted the same phenomenon in the US:
A decision making model for an optimal medicine using analytical hierarchical processes
Authors: Jeong-Mi Yoon, André de Korvin
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

To decide on an optimal pain medicine from a clinician's viewpoint for patients who complain about pain after surgery, we use the method of Analytical Hierarchical Processes (AHP). This is an extended application of the classical AHP which has optimality. Uncertainty in assigning priorities and the use of semantic variables leads to the inclusion of fuzzy sets into the structure of the AHP paradigm. We describe our model by a hierarchical process having four levels. We will introduce inconsistencies in some of our evaluations.
A Fuzzy Approach to Ranking Hyperlinks
Authors: Huaxiang Zhang, Jing Lu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper presents a fuzzy approach to efficiently crawling topic related web pages using reinforcement learning and fuzzy clustering theory. The approach, FOA, takes the delayed reward into account and subsequently labels newly crawled web pages online. To minimize the bad effect of the naïve Bäyes classifiers, we adopt the fuzzy center-averaged clustering method to label crawled web pages, and using the calculated fuzzy memberships as class weights when calculating the fuzzy averaged Q values that map hyperlinks to future discounted rewards. The candidate hyperlinks are ranked according to their corresponding fuzzy averaged Q values, and the hyperlink with the optimal Q value is the best one to be crawled in the next step. Experiments of topic crawling tasks have shown FOA collects high harvest rate.
Estimation of statistical variation in temporal NBTI degradation and its impact on lifetime circuit performance
Authors: Kunhyuk Kang, Sang Phill Park, Kaushik Roy, Muhammad A. Alam
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Negative bias temperature instability (NBTI) in MOSFETs is one of the major reliability concerns in sub-100nm technologies. So far, studies of NBTI and its impact on circuit performance have assumed an average behavior of the degradation process. However, in very short channel devices, finite number of Si-H bonds in the channel can induce a statistical random variation of the degradation process. This results in significant random Vt variations in PMOS transistor. The NBTI induced variation depends on operating temperature and the effective stress period for the specific device. In this paper, we analyze the impact of stochastic temporal NBTI variations and propose a compact circuit level Vt model. Using the proposed model, we show how temporal Vt variations can affect the lifetime performance of different circuit topologies including 6T SRAM cell and random combinational logic circuits.
Conditionally heteroscedastic factorial HMMs for time series in finance
Authors: Mohamed Saidane, Christian Lavergne
Venue: Applied Stochastic Models in Business and Industry (2007)

In this article, we develop a new approach within the framework of asset pricing models that incorporates two key features of the latent volatility: co-movement among conditionally heteroscedastic financial returns and switching between different unobservable regimes. By combining latent factor models with hidden Markov chain models we derive a dynamical local model for segmentation and prediction of multivariate conditionally heteroscedastic financial time series. We concentrate more precisely on situations where the factor variances are modelled by univariate generalized quadratic autoregressive conditionally heteroscedastic processes. The expectation maximization algorithm that we have developed for the maximum likelihood estimation is based on a quasi-optimal switching Kalman filter approach combined with a generalized pseudo-Bayesian approximation, which yield inferences about the unobservable path of the common factors, their variances and the latent variable of the state process. Extensive Monte Carlo simulations and preliminary experiments obtained with daily foreign exchange rate returns of eight currencies show promising results. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Autocorrelation Kernel Functions for Support Vector Machines
Authors: Rui Kong, Bing Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Kernel functions (kernel) are key part and the hard issue of Support Vector Machines. We research the relation of kernel functions and nonlinear mappings and mapped spaces. A new kind of admissible Support Vector Machines kernel is presented. It is autocorrelation kernel. The theory proofs certify that autocorrelation functions are admissible Support Vector Machines kernel. Several experiments also showed the validity of the autocorrelation kernel in classification and regression.
A New Methodology for Building Ontology Based on Reusing the Heterogeneous Ontologies
Authors: Qing Yao, QingXian Wang, Yan Liu, Qiang Wang, JunYong Luo
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Building ontology is a craft rather than an engineering activity. Many research institutions spend a great deal of money, material, manpower and time but the results are still very superficial and immature. An effective approach to construct ontology is demanded urgently. For this pur- pose, we propose a new method, BBR (Build By Reuse) in this paper. With this method, you needn't formalize concept by experts every time. However the exactitude could be en- sured. Furthermore, ontology built by this method covers conceptions of domain in maximum and has stronger exten- sibility.
Simultaneous Transient Analysis of QBD Markov Chains for all Initial Configurations using a Level Based Recursion
Authors: J. Van Velthoven, B. Van Houdt, C. Blondia
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

A new algorithm to assess transient performance measures for every possible initial configuration of a Quasi- Birth-and-Death (QBD) Markov chain is introduced. We make use of the framework termed QBDs with marked time epochs that transforms the transient problem into a stationary one by applying a discrete Erlangization and constructing a reset Markov chain. To avoid the need to repeat all computations for each initial configuration, we propose a level based recursive algorithm that uses intermediate results obtained for initial states belonging to levels 0, . . . , r -1 to compute the transient measure when the initial state is part of level r. Also, the computations for all states belonging to level r are performed simultaneously. A key property of our approach lies in the exploitation of the internal structure of the block matrices involved, avoiding any need to store large matrices. A flexible Matlab implementation of the proposed algorithm is available online.
Performance Improvement in Speech Recognition Using Multimodal Features
Authors: Myung Won Kim, Won Moon Song, Young Jin Kim, Eun Ju Kim
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this paper, we propose a neural network based model of robust speech recognition by integrating audio, visual, and contextual information. Bimodal Neural Network(BMNN) is a multi-layer perceptron of 4 layers, which combines audio and visual features of speech to compensate loss of audio information caused by noise. In order to improve the accuracy of speech recognition in noisy environments, we also propose a post-processing based on contextual information which are sequential patterns of words spoken by a user. Our experimental results show that our model outperforms any single mode models. Particularly, when we use the contextual information, we can obtain over 90% recognition accuracy even in noisy environments, which is a significant improvement compared with the state of art in speech recognition.
On testing satisfiability of tree pattern queries
Authors: Laks V. S. Lakshmanan, Ganesh Ramesh, Hui Wang, Zheng Zhao
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

XPath and XQuery (which includes XPath as a sublanguage) are the major query languages for XML. An important issue arising in efficient evaluation of queries expressed in these languages is satisfiability, i.e., whether there exists a database, consistent with the schema if one is available, on which the query has a non-empty answer. Our experience shows satisfiability check can effect substantial savings in query evaluation. We systematically study satisfiability of tree pattern queries (which capture a useful fragment of XPath) together with additional constraints, with or without a schema. We identify cases in which this problem can be solved in polynomial time and develop novel efficient algorithms for this purpose. We also show that in several cases, the problem is NP-complete. We ran a comprehensive set of experiments to verify the utility of satisfiability check as a preprocessing step in query processing. Our results show that this check takes a negligible fraction of the time needed for processing the query while often yielding substantial savings.
Buddy: Harnessing the power of the internet: Research Articles
Authors: Douglas Boulware, John Salerno, Nina Zumel, Michael Manno
Venue: International Journal of Intelligent Systems (2008)

The Internet has become a way of life. In the past, when someone wanted to perform research he or she would go to the library, and proceed to the card catalogue to locate a book or to a set of periodicals for magazines. Today we sit in front of our computer, launch our Internet browser, bring up a search engine, and perform various searches by entering a simple keyword, phrase, or more complex Boolean expression. The Internet can be a great asset by significantly cutting the time-consuming burden of finding relevant documents/papers; however, how do we know where and what we are searching? How many times do we perform a query and get irrelevant documents? In this article we investigate today's search engines, what is meant by coverage, and what metasearch engines bring to the table. We also look at both their abilities and deficiencies and present a capability that attempts to put more power at the finger tips of the user. This capability is what we call "Buddy." &copy; 2008 Wiley Periodicals, Inc.