ppxscal/embedding_network huggingface dataset:
Database programming with data abstractions
Authors: Burt Leavenworth
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

This paper describes how a general purpose programming language supporting the notion of data abstraction can be used as a data definition and manipulation language for database management systems. The examples used here are based on a functional data model and on a database system called NDB. However, the approach is not limited to or biased towards any particular data model or architecture. The strong typing properties of the data abstraction language are carried over to the realm of database manipulation operations and provide useful consistency checking. The advantage of the approach is that the user deals with but one database programming language, thereby avoiding a separate query and host language.
A practical methodology for realizing product service systems for consumer products
Authors: Xiaoyu Yang, Philip Moore, Jun-Sheng Pu, Chi-Biu Wong
Venue: Computers and Industrial Engineering (2009)

Current Product Service Systems (PSS) research mainly focuses on car sharing schemes and chemical management services, which has not really addressed consumer products. Existing methods and tools related to PSS are mainly concerned with general PSS and service design, which can not readily assist manufacturers of consumer products to implement and realize PSS solutions. This paper proposes a methodology for the realization of product-oriented and use-oriented PSS for consumer products through the use of product lifecycle data. It has been demonstrated in large-scale field trials that product related services can be delivered through the PSS built utilizing the methodology proposed. The PSS methodology proposed within this research study can contribute to next generation product design, which will be intelligent, sustainable and environmentally sensitive.
Low-power CMOS transceiver circuits for 60GHz band millimeter-wave impulse radio
Authors: Ahmet Oncu, Minoru Fujishima
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

In this paper we present an 8Gbps CMOS amplitude-shift-keying (ASK) modulator in the transmitter and a 19.2mW 2Gbps CMOS pulse receiver circuits for high-speed and low-power 60GHz millimeter-wave impulse radio. High-speed ASK modulation is obtained without using DC power by turning on and off of the shunt connected short channel NMOSFET switches. The isolation is maximized using quarter-wavelength on-chip transmission lines. The isolation data-rate product of this work is 3.7 times higher than recently reported millimeter-wave ASK modulators. The proposed 60GHz pulse receiver circuit requires low-power for high-speed data since it detects the envelope of the received pulses using a nonlinear detecting amplifier and only limiting amplifier process the high-speed data. This receiver requires the lowest DC power among recently reported millimeter-wave receivers.
BBC iPlayer "Penguins"
Authors: Darren Walsh
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

Filmmaker and writer Terry Jones is the latest star to feature in an ambitious marketing trailer for BBC iPlayer. The 90-second trailer shows Terry following a unique colony of Adelie penguins as they fly thousands of miles across the frozen wasteland of Antarctica to the Amazon rainforest. It was shown on air on April Fools' Day in tandem with a viral campaign launched online.
A new a posteriori error estimate for the Morley element
Authors: Jun Hu, Zhongci Shi
Venue: Numerische Mathematik (2009)

In this paper, we present a posteriori error analysis for the nonconforming Morley element of the fourth order elliptic equation. We propose a new residual-based a posteriori error estimator and prove its reliability and efficiency. These results refine those of Beirao da Veiga et al. (Numer Math 106:165&#x2013;179, 2007) by dropping two edge jump terms in both the energy norm of the error and the estimator, and those of Wang and Zhang (Local a priori and a posteriori error estimates of finite elements for biharmonic equation, Research Report, 13, 2006) by showing the efficiency in the sense of Verf&#x00fc;rth (A review of a posteriori error estimation and adaptive mesh-refinement techniques, Wiley-Teubner, New York, 1996). Moreover, the normal component in the estimators of Beirao da Veiga et al. (Numer Math 106:165&#x2013;179, 2007) and Wang and Zhang (Local a priori and a posteriori error estimates of finite elements for biharmonic equation, Research Report, 13, 2006) is dropped, and therefore only the tangential component of the stress on each edge comes into the estimator. In addition, we generalize these results to three dimensional case.
Using Hand Gesture and Speech in a Multimodal Augmented Reality Environment
Authors: Miguel Sales Dias, Rafael Bastos, João Fernandes, João Tavares, Pedro Santos
Venue: Gesture-Based Human-Computer Interaction and Simulation: 7th International Gesture Workshop, GW 2007, Lisbon, Portugal, May 23-25, 2007, Revised Selected Papers (2009)

In this work we describe a 3D authoring tool which takes advantage of multimodal interfaces such as gestures and speech. This tool allows real-time Augmented Reality aimed to aid the tasks of interior architects and designers. This approach intends to be an alternative to traditional techniques. The main benefit of using a multimodal based augmented reality system is the provision of a more transparent, flexible, efficient and expressive means of human-computer interaction.
The speed control of DC servo motor with proportional integral, fuzzy logic and adaptive neuro-fuzzy inference systems
Authors: Ismail Temiz, Mehmet Akar
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

In this study DC servo motor's mathematical model and equations were extracted for solving the speed control problem. There were three different methods used for controlling the speed. It was created simulation model at the Matlab programme and implemented proportional-integral, fuzzy and adaptive neuro fuzzy inference system controllers respectively while it was working variable conditions. At the servo motor application it is expected that no overshoot, settling reference value quickly and minimum influence on the system stability.
Simulation based sales forecasting on retail small stores
Authors: Hai Rong Lv, Xin Xin Bai, Wen Jun Yin, Jin Dong
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

As the competition becomes more and more intense, many retail small store chain operators are eager to know how to evaluate new store locations quantitatively to support a scientific business development decision, e.g. what will be the potential sales of new stores? How will a new store influence other existing stores? In this paper, we propose a novel framework that can predict the competitions between new store and competing stores. First, we examine the special characteristics of customers' demand on retail small stores and develop several models to estimate different customers' demand; and then model the relationship between customers and multiple stores, such as route model, user behavior model; finally, we compute the store sales via simulation. A real case on the micro-competition analysis in a China city for one of the famous retail small store chain operators shows that our method is more practical and accurate than other methods.
SCTPfx: a fast failover mechanism based on cross-layer architecture in SCTP multihoming
Authors: Yunsop Han, Fumio Teraoka
Venue: Proceedings of the 4th Asian Conference on Internet Engineering (2008)

This paper proposes SCTPfx, a fast failover mechanism in SCTP multihoming. For data communication, SCTP uses a single path among multiple available paths in an association. This path is called the primary path. If the primary path fails, failover procedure is carried out, i.e., one of the secondary path is engaged as the new primary. However, it takes more than 30 sec for failover because SCTP detects primary path failure by timeouts of several data chunks. To solve this problem, SCTPfx employs a cross-layer architecture called CEAL. CEAL can quickly notify SCTP of primary path failure caused by an event in the link layer or the network layer, e.g., the Ethernet cable was unplugged by accident, the IP address of the interface became unavailable due to timeout, or an ICMP unreach message was received. SCTPfx also supports fast recovery, i.e., when the original primary path recovers after failover, it is quickly engaged as the new primary again. SCTPfx was implemented on FreeBSD. As a result of measurements in our test network, SCTPfx achieves failover in 40 msec.
Design and Implementation of Energy-Collection-Based Low Complexity IR-UWB Receiver
Authors: Soon-Woo Lee, Young-Jin Park, Kwan-Ho Kim
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, an energy-collection-based non-coherent IR-UWB receiver allowing low complexity and low power consumption is proposed for short range data communication. The proposed receiver consists of an on-the-fly integrator, a 1-bit digital sampler, a pre-processor and a digital symbol synchronizer. The on-the-fly integrator for energy collection and the 1-bit digital sampler reduce complexity of IR-UWB system. Furthermore, with a simple digital filter in the pre-processing unit, SNR and robustness of the receiver against time-varying channel are enhanced. Also the receiver complexity is diminished by a simple scheme of symbol synchronization based on rough time information about incoming pulses, not requiring exact timing information. The performance of the proposed receiver is simulated based on IEEE 802.15.4a channel model and the algorithms are implemented and verified on a FPGA.
A Novel Approach for Conflict Resolution in Context-Awareness Using Semantic Unification of Multi-Cognition
Authors: Keonsoo Lee, Minkoo Kim
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

The context helps service providers to perform their works properly even if the user's request has implicit meanings. The context of service can be viewed as the situation of the environment which is related to the service's execution. In order to provide such autonomous and intelligent service, the provider needs to be aware of the context by sensing the environment. In this sensing process, the conflicts can happen. One of the origins of these conflicts is the discord of the sensing data's meaning that is used for recognizing the context by different providers. This difference can cause the conflict in providing services such as keeping the music or keeping the serenity of the space. In this paper, we propose a conflict resolution method by unifying these semantic discards of sensed data. This unified meaning can keep the multiple services from recognizing the environment differently.
Annotation and Matching of First-Class Agent Interaction Protocols
Authors: Tim Miller, Peter Mcburney
Venue: Argumentation in Multi-Agent Systems: Fifth International Workshop, ArgMAS 2008, Estoril, Portugal, May 12, 2008. Revised Selected and Invited Papers (2009)

Many practitioners view agent interaction protocols as rigid specifications that are defined a priori, and hard-code their agents with a set of protocols known at design time -- an unnecessary restriction for intelligent and adaptive agents. To achieve the full potential of multi-agent systems, we believe that it is important that multi-agent interaction protocols are treated as first-class computational entities in systems. That is, they exist at runtime in systems as entities that can be referenced, inspected, composed, invoked and shared, rather than as abstractions that emerge from the behaviour of the participants. Using first-class protocols, a goal-directed agent can assess a library of protocols at runtime to determine which protocols best achieve a particular goal. In this paper, we presented three methods that enable agents to determine if a protocol achieves a specified goal. The two most promising approaches allow an agent to summarise a protocol that it has learned by calculating the outcomes achieved by the protocol, and annotate the protocol with these summaries. The agent can match, via annotations, which protocols in a library achieve a given goal.
Broadband Near-Field Range and Bearing Estimation Based on Fourth-Order Cumulants
Authors: Xuezhi Yan, Hong Jiang, Ke Wang, Shuxun Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In the paper, the problem of broadband near-field source localization is investigated. A novel method for joint range and bearing estimation of broadband near-field sources is proposed using coherent signal subspace method (CSM) and fourth-order cumulant. The broadband of near-field source is divided into multiple narrowband frequency bins. Coherent focusing of the received data over multiple frequency bins is studied. To estimate the ranges and bearings for near-field sources, a cumulant-based subspace method is then presented to obtain estimated parameters from eigenvectors and eigenvalues of the eigen-decomposition of the cumulant matrix. Compared with 2D-MUSIC method for broadband near-field localization, the advantages of the proposed method lie in that multiple-dimension search computation is not required and Gaussian colored noise is effectively removed.
Focal points for DSS effectiveness
Authors: Carl Harrington
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

The primary emphasis in this presentation is to take a top-down view of a decision support system (DSS) and to see how the mere existence of DSS causes improvement in management effectiveness. The areas covered include development of information needs, requirement of consistency in using information, discipline in decision making, and the integration of decisions toward goals. The improved effectiveness from these areas is inherent in the information requirements that are set up during the development of a DSS. Can there be any doubt that improved information consistency and discipline in decision making improves management effectiveness? In other words, no matter the computational advantages and the efficiency of computers to manipulate and display numbers, a DSS automatically results in the identification of issues, begs for the resolution of those issues, and thus produces more consistent and integrated decisions in the choices of action plans and programs for the achievement of corporate goals. 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
Symmetries and the complexity of pure Nash equilibrium
Authors: Felix Brandt, Felix Fischer, Markus Holzer
Venue: Journal of Computer and System Sciences (2009)

Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, is that players cannot, or need not, distinguish between the other players. We investigate the computational complexity of pure Nash equilibria in four classes of symmetric games obtained by considering two additional properties: identical payoff functions for all players and the ability to distinguish oneself from the other players. In contrast to other types of succinctly representable multi-player games, the pure equilibrium problem is tractable in all four classes when only a constant number of actions is available to each player. Identical payoff functions make the difference between TC^0-completeness and membership in AC^0, while a growing number of actions renders the equilibrium problem NP-hard for three of the classes and PLS-hard for the most restricted class for which the existence of a pure equilibrium is guaranteed. Our results also extend to larger classes of threshold symmetric games where players are unable to determine the exact number of players playing a certain action.
Verification and validation of a SSM model dedicated to mode handling of flexible manufacturing systems
Authors: Nadia Hamani, Nathalie Dangoumau, Etienne Craye
Venue: Computers in Industry (2009)

This paper focuses on verification and validation of a model dedicated to mode handling of flexible manufacturing systems (FMSs). This model is specified using the synchronous formalism safe state machines (SSMs). The rigorous semantics that characterize such formalism enable to provide formal verification mechanisms ensuring determinism and dependability. A structured framework for verification and validation of the model dedicated to mode handling is proposed. The main properties being verified within this framework and the corresponding verification methods are presented. The approach is illustrated using an example of a manufacturing production cell. The formal analysis tools integrated into the development environment Esterel Studio are used within the design process.
IEEE Intelligent Systems Honors Volunteer Reviewers
Venue: IEEE Intelligent Systems (2009)

This article thanks all of the volunteer reviewers from 2008 who contributed their time to IEEE Intelligent Systems to ensure that the magazine contains the very best content in research and development in artificial intelligence. The excellence of the peer-reviewed articles that appear in IS stems from the tireless efforts of the magazine's volunteer reviewers.
Tools and algorithms for refined comparison of protein structures
Authors: Yaw-Ling Lin, Shih-Peng Huang
Venue: Proceedings of the 6th conference on Microelectronics, nanoelectronics, optoelectronics (2007)

Protein structure provides the opportunity to recognize homology that is undetectable by sequence comparison, and it represents a powerful means of discovering functions, yielding direct insight into the molecular mechanisms. In this paper, we propose algorithms and develop tools for pairwise alignment of protein structures. Methods of locating suitable isometric transformations of one structure and aligning it to the other structure are addressed. Our methods allow sequence gaps of any length, reversal of chain direction, and free topological connectivity of atom sequences. We show the effectiveness of the proposed refinement methods by a set of experiments, which improve several previous results.
Negotiation Model Supporting Co-Allocation for Grid Scheduling
Authors: Jiadao Li, Ramin Yahyapour
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

In order to fulfill the complex resource requirements of some users in Grid environments, support for coallocation between different resource providers is needed. Here, it is quite difficult to coordinate these different services from different resource providers, because a Grid scheduler has to cope with different policies and objectives of the different resource providers and of the users. Agreement-based resource management is considered a feasible solution to solve many of these problems as it supports the reliable interaction between different providers and users. However, most current models do not well support co-allocation. Here, negotiation is needed to create such bi-lateral agreements between several Grid parties. Such a negotiation process should be automated with no or minimal human interaction, considering the potential scale of Grid systems and the amount of necessary transactions. Therefore, strategic negotiation models play an important role. In this paper, a negotiation models which supports the co-allocation between different resource providers are proposed and examined. First simulations have been conducted to evaluate the presented system. The results demonstrate that the proposed negotiation model are suitable and effective for Grid environments.
Mass memory systems
Authors: John C. Davis Dennis Luck Eric Salbu, Carol Peters, Robert Koenig, Glen Bacon
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The concept of what capacity constitutes a "mass" memory system has been growing by 10 bits per decade. This trend is expected to continue at least through the 1980's. A mass memory system as now defined must have a capacity of greater than 10 bits.
Parallel transistor level circuit simulation using domain decomposition methods
Authors: He Peng, Chung-Kuan Cheng
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

This paper presents an efficient parallel transistor level full-chip circuit simulation tool with SPICE-accuracy. The new approach partitions the circuit into a linear domain and several non-linear domains based on circuit non-linearity and connectivity. The linear domain is solved by parallel fast linear solver while nonlinear domains are parallelly distributed into different processors and solved by direct solver. Parallel domain decomposition technique is used to iteratively solve the different partitions of the circuit and ensure convergence. Different domain decomposition techniques are discussed. Orders of magnitude speedup over SPICE is observed for sets of large-scale VLSI circuits.
Static Cache Partitioning Robustness Analysis for Embedded On-Chip Multi-processors
Authors: Anca M. Molnos, Sorin D. Cotofana, Marc J. Heijligers, Jos T. Eijndhoven
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

In this paper we propose a method to analyze the robustness of multi-tasking media applications when mapped on an on-chip multiprocessor platform. We assume a multiprocessor structure which embeds a cache hierarchy with two levels: an L1 that each processor may have and an L2 shared among the processors. To enable compositionality, i.e, to be able to evaluate the system performance out of the individual tasks performance, this shared L2 is partitioned per task basis. In this paper we first introduce two metrics to quantify the robustness. The internal robustness is estimated by a sensitivity function which measures the performance variations induced by the inter-task cache interference. The external robustness is quantified by a stability function which reflects the variations induced by different input data on the partitioned L2 behavior. Subsequently, we exercise our method on a set of multimedia applications running on a CAKE multi-processor platform. Our experiments indicate that, if the cache is partitioned, the sensitivity is on average 4%. whereas for the shared cache it is 25%. Over the investigated workloads the stability is at least 90% therefore, for the those applications, we can conclude that the static cache partitioning is quite robust to input stimuli.
Investigation of thermal management in optically pumped, antimonide VECSELs
Authors: Kamil Pierciński, Dorota Piercińska, Maciej Bugajski, Christian Manz, Marcel Rattunde
Venue: Microelectronics Journal (2009)

In this work, an optical modulation spectroscopy technique: thermoreflectance has been employed to study temperature distributions on the surface of optically pumped vertical external cavity surface emitting lasers (VECSELs). The thermoreflectance is based on the relative change of reflectivity of the sample induced by the change of its temperature. In this case the temperature change of the sample is induced by operating the pump in pulse mode. We have investigated samples with and without intracavity heatspreader. The resulting temperatures and temperature distributions on the sample surface have been measured and compared with theoretical calculations. The results confirm the effectiveness of silicon carbide (SiC) heatspreader approach. This is also a first report on the direct temperature mapping on VECSELs, with micron spatial resolution.