ppxscal/embedding_network huggingface dataset:
On the use of surrounding neighbors for synthetic over-sampling of the minority class
Authors: V. García, J. S. Sánchez, R. A. Mollineda
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

It has been observed that class imbalance may produce an important deterioration of the classification accuracy. One of the most popular methods to tackle this problem is the synthetic minority over-sampling technique (SMOTE). From the original SMOTE algorithm, we here propose the use of three surrounding neighborhood approaches with the aim of generating artificial minority examples, but taking both the proximity and the spatial distribution of the examples into account. Experiments with ten real data sets are conducted to compare the models introduced in this paper with SMOTE, demonstrating their effectiveness in a number of problems.
Tunnel_Sim: decision support tool for planning tunnel construction using computer simulation
Authors: Mohamed Marzok, Moatassem Abdallah, Moheeb El-Said
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Tunnel construction are essentially infrastructure projects that includes many interfered and sophisticated tasks. This paper presents a decision support tool, Tunnel_Sim, for planning tunnel construction projects using computer simulation. The proposed tool assists contractors in estimating time and cost, required for the construction of tunnel projects. Five construction techniques are coded in the proposed tool to capture the construction of open/closed rectangular cross-section tunnels and circular cross-section tunnels. The decision support tool divides the construction of tunnels into working zones. It estimates the total duration and cost for each zone. The proposed tool selects the best construction technique from a set of alternatives based on a decision making method that utilizes fuzzy numbers. An application example is presented to demonstrate the characteristics of the proposed Tunnel_Sim.
Applying causal inference to understand emergent behavior
Authors: Ross Gore, Paul F. Reynolds,  Jr.
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Emergent behaviors in simulations require explanation, so that valid behaviors can be separated from design or coding errors. Validation of emergent behavior requires accumulation of insight into the behavior and the conditions under which it arises. Previously, we have introduced an approach, Explanation Exploration (EE), to gather insight into emergent behaviors using semi-automatic model adaptation. We improve our previous work by iteratively applying causal inference procedures to samples gathered from the semi-automatic model adaptation. Iterative application of causal inference procedures reveals the interactions of identified abstractions within the model that cause the emergent behavior. Uncovering these interactions gives the subject matter expert new insight into the emergent behavior and facilitates the validation process.
Our 2008 Reviewers
Authors: Dale Strok
Venue: IEEE Software (2009)

We thank the magazine's reviewers for their dedicated work in 2008.
Exploiting parallelism for the performance enhancement of non-numeric applications
Authors: David J. Dewitt, Dina Friedland
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

In this paper we examine the design of computer architectures that use parallelism to enhance the performance of non-numeric applications. In particular we examine how the technology of mass-storage devices has affected the design of computer architectures for non-numeric processing.
Learning the membership function contexts for mining fuzzy association rules by using genetic algorithms
Authors: Jesús Alcalá-Fdez, Rafael Alcalá, María José Gacto, Francisco Herrera
Venue: Fuzzy Sets and Systems (2009)

Different studies have proposed methods for mining fuzzy association rules from quantitative data, where the membership functions were assumed to be known in advance. However, it is not an easy task to know a priori the most appropriate fuzzy sets that cover the domains of quantitative attributes for mining fuzzy association rules. This paper thus presents a new fuzzy data-mining algorithm for extracting both fuzzy association rules and membership functions by means of a genetic learning of the membership functions and a basic method for mining fuzzy association rules. It is based on the 2-tuples linguistic representation model allowing us to adjust the context associated to the linguistic term membership functions. Experimental results show the effectiveness of the framework.
OWL-L: An OWL-based language for Web resources links
Authors: I-Ching Hsu, Yuan Kwei Tzeng, Der-Cheng Huang
Venue: Computer Standards Interfaces (2009)

Although providing metadata association, XLink lacks computer-interpretability to support knowledge representation for intelligent applications. This study proposes an OWL-based language, called OWL-L, to make Web resources links computer-interpretable. Two aspects of OWL-L, link profile and link model are described. The link profile provides the information required for an agent to discover a link, while the link model provides information that enables an agent to exploit a link. Finally, this study describes the feasibility of using role/arcRole properties of links to represent OWL-based ontologies, which can thus seamlessly interoperate and integrate with OWL-L to enhance knowledge representation.
Path selection for monitoring unexpected systematic timing effects
Authors: Nicholas Callegari, Pouria Bastani, Li-C. Wang, Sreejit Chakravarty, Alexander Tetelbaum
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

This paper presents a novel path selection methodology to select paths for monitoring unexpected systematic timing effects. The methodology consists of three components: path filtering, path encoding, and path clustering. Given a large set of critical paths, in path filtering, the goal is to filter out paths that cannot be functionally sensitized. To explore the space of unexpected timing effects, a set of features are defined to encode paths into path vectors. Each feature is a source of concern that may potentially contribute to the cause of an unexpected timing effect. Finally, a kernel-based clustering algorithm is employed to group similar path vectors into clusters from which the best representative paths are selected for post-silicon monitoring. The effectiveness of our proposed methodology is demonstrated through experiments on an industrial ASIC design.
A student-designed language as a multicourse project: enabling students to construct connections
Authors: Carol Browning, Scott Sigman
Venue: Journal of Computing Sciences in Colleges (2009)

Group projects are widely used in computer science education. However, projects that span more than one semester are typical only in capstone sequences. In addition to the typical advantages of group project work, there are significant motivational and cognitive benefits for students who have a group project that continues into a second course. This paper presents these benefits and describes the content of a multicourse project in language design and development as it relates to these benefits. The project description is presented as a model for applications in other multicourse contexts.
Speaker Indexing for News Articles, Debates and Drama in Broadcasted Tv Programs
Authors: Masafumi Nishida, Yasuo Ariki
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this paper, we propose a method to extract and verify individual speaker utterance using a subspace method. This method can extract speech section of the same speaker by repeating speaker verification between the present speech section and the immediately previous speech section. The speaker models are automatically trained in the verification process without constructing speaker templates in advance. As a result, this speaker verification method is applied to speaker indexing. In this study, announcer utterances are automatically extracted from news speech data which includes reporter or interviewer utterances. Also extracted automatically are the utterances of each participant in debate program broadcasted on TV. Furthermore, speech sections of actor or actress in TV drama are extracted.
An Architecture of Distributed Media Servers for Supporting Guaranteed QoS and Media Indexing
Authors: Feng Cao, Jeff Smith, Kenji Takahashi
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In a distributed multimedia system, multimedia sessions may get involved with multiple media servers for the retrievals of the media data or the creations of the new multimedia documents. To provide the guaranteed Quality of Service (QoS) to real-time applications such as continuous media transfers, the system resources in the media servers must be reserved to avoid the contentions during the execution time. Media indexing is also needed to support searching the media data in such a distributed environment and to provide the necessary information about the usage of system resources for delivering the media data. Due to the overhead, a centralized approach of scheduling all the requests and searching all the media data from only one agent is not efficient, and not scalable. In this study, we proposed a new architecture with dividing the media servers into multiple groups of the right size. Within each group, there are a registration agent and an index agent, which take care of the resource reservation, membership management, media indexing searching, and load balancing. We demonstrate how to provide the guaranteed QoS by scheduling the requests among the multiple groups, and show the collaborations between the registration agents and the index agents inside and outside a group. The mobile media servers can fit in this architecture by the updates of membership status from the registration agents. The new IETF drafts such as SIP, RTSP and RTP are embedded into this architecture to support the general multiparty multimedia applications for real-time media streams.
1.2 V, 24 mW/ch, 10 bit, 80 MSample/s Pipelined A/D Converters
Authors: Takeshi Ueno, Tomohiko Ito, Daisuke Kurose, Takafumi Yamaji, Tetsuro Itakura
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper describes 10-bit, 80-MSample/s pipelined A/D converters for wireless-communication terminals. To reduce power consumption, we employed the I/Q amplifier sharing technique [1] in which an amplifier is used for both I and Q channels. In addition, common-source, pseudo-differential (PD) amplifiers are used in all the conversion stages for further power reduction. Common-mode disturbances are removed by the proposed common-mode feedforward (CMFF) technique without using fully differential (FD) amplifiers. The converter was implemented in a 90-nm CMOS technology, and it consumes only 24 mW/ch from a 1.2-V power supply. The measured SNR and SNDR are 58.6 dB and 52.2 dB, respectively.
Active Objects in Interactive Mobile TV
Authors: J. Deigmöller, G. Fernàndez, A. Kriechbaum, A. López, B. Mérialdo, H. Neuschmied, F. Pinyol Margalef, R. Trichet, P. Wolf, R. Salgado, F. Milagaia
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

The porTiVity project is developing a converged rich media iTV system, which integrates broadcast and mobile broadband delivery to portables and mobiles and which will enable the end-user to act on moving objects within TV programmes. The developments of the project include the playout of portable rich media iTV and the middleware, data and presentation engine in the handheld receiver. In this demonstration, we will present, on the production side, the Live Annotation Tool which allows the video editor to define and include active objects in Live TV Programs, and on the user side, the interaction with active objects on a mobile terminal.
Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS
Venue: Geographic Information Systems (2008)

It is our great pleasure to welcome you to the inaugural Workshop on Security and Privacy in GIS and LBS (SPRINGL 2008) which is being held in conjunction with the ACM SIGSPATIAL GIS conference. The aim of the workshop is to lay the foundation and agenda for research and development in the area of geospatial data security and privacy. Today's world is witnessing a dramatic increase and dissemination of geospatial data in several application contexts including homeland security, environmental crises, and natural and industrial disasters. Geospatial infrastructures are being leveraged by companies to provide a large variety of location-based services (LBS) able to tailor services to users. However, despite the increase of publicly accessible geospatial information only little attention is being paid on how to secure geospatial information systems (GIS) and LBS. Privacy is also of increasing concern given the sensitivity of personally-identifiable location information. This is despite major advancements that have been made in secure computing infrastructures and the secure and privacy-preserving management of traditional (relational) data in particular. Given these pressing needs for securing GIS and LBS as well as assuring privacy, it is compelling to investigate security and privacy aspects as they relate to the management of geospatial data and the development of both emerging LBS and mission-critical geographic applications. We hope that these proceedings will serve as a valuable reference for researchers and practitioners and facilitate further research and development in geospatial data security and privacy.
Developing augmented reality applications
Authors: Mark Billinghurst, Raphael Grasset
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

As computers become more invisible, Augmented Reality (overlaying virtual images on the real world) is an increasingly important application area for computer graphics and user interface design. This tutorial will provide a detailed introduction to AR interface design and research, with reviews of topics as such as tracking and registration, interaction techniques, design principles, and usability evaluation, as well as areas for future AR research. Portions of the tutorial will be devoted to the ARToolKit and osgART open-source software tools for building AR applications. Participants will leave knowing how to build AR applications that provide a high quality user experience.
A bounded rational review of approximation and undecidability in economic modelling
Authors: Emil M. Popa, Ralf Fabian, Cristina Brumar
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The paper aims at: a) showing that approximation and undecidability refer to entirely different and incommensurable kinds of uncertain knowledge processing and have non-intersecting application domains; b) exposing the shortcomings of conservative approaches (including approximation theory) for treating "real-world undecidability" in applications meant for open, dynamic, and uncertain environments (first of all where modelling decision-making is concerned); c) outlining the rationale and the approach (based on bounded rationality) to deal with all kinds of uncertainty arising in economic modelling. (The mechanisms involved are only briefly suggested, being described in papers referred to.) Among the conclusions: approximation is still a valuable asset in modelling but mainly aiming at effectiveness, not at uncertain knowledge processing, because of its atemporality (mainly its ineffectiveness in dealing with future events); the bounded-rationality approach proposed in this paper enables both better economic models and better modelling (being based on trends in economic modelling as well as on agent-oriented software engineering).
The role of correct measurements in the modeling of microwave active devices
Authors: J. M. Zamanillo, A. Mediavilla, C. Pérez-Vega
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

This paper describes some of the experiences and know-how of our group in the measurement of microwave active devices, namely MESFETs, HEMTs and HBTs transistors, as well as the development of electrical models based on such measurements. The aim of this work is to popularize in the scientific community some improvements in the measuring techniques, in order to get more accurate electrical models, particularly in medium and high power devices.
Minimal realization algorithm for multidimensional hybrid systems
Authors: Valeriu Prepelita
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

A class of multidimensional time-invariant hybrid systems is studied, which depends on q continuous-time variables and on r discrete-time ones. The formula of the input-output map of these systems is given. A multiple (q, r)-hybrid Laplace transformation is defined and it is used to determine the transfer matrices of the considered systems. The minimal realization problem is analysed and an algorithm is given which provides minimal realizations.
Point-of-sale systems for supermarkets
Authors: Vernon L. Schaatz, Vern Sdhaatz, Doug Brookings, Dan Minter, Ron Low, Lee Paulson
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The session on Point-of-Sale Systems will be primarily concerned with supermarket operations. It will emphasize live experience in the use of such systems. Discussions of current experience will be complemented by discussions of the anticipated impact of the Uniform Grocery Products Code (UPC) and scanning.
Web Mining for Understanding Stories through Graph Visualisation
Authors: Ilija Subaic, Bettina Berendt
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Rich information spaces (like the Web or scientific publications) are full of "stories": sets of statements that evolve over time, manifested as, for example, collections of newspaper articles reporting events relating to an evolving crime investigation, sets of news articles and blog posts accompanying the development of a political election campaign, or sequences of scientific papers on a topic. In this paper, we propose a method and a visualisation tool for mapping and interacting with such stories. In contrast to existing approaches, our method concentrates on relational information and on local patterns rather than on the occurrence of individual concepts and global models. In addition, we present an evaluation framework. A real-life case study is used to illustrate and evaluate the method and tool.
High Level Thread-Based Competitive Or-Parallelism in Logtalk
Authors: Paulo Moura, Ricardo Rocha, Sara C. Madeira
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

This paper presents the logic programming concept of thread-based competitive or-parallelism, which combines the original idea of competitive or-parallelism with committed-choice nondeterminism and speculative threading. In thread-based competitive or-parallelism, an explicit disjunction of subgoals is interpreted as a set of concurrent alternatives, each running in its own thread. The individual subgoals usually correspond to predicates implementing different procedures that, depending on the problem specifics, are expected to either fail or succeed with different performance levels. The subgoals compete for providing an answer and the first successful subgoal leads to the termination of the remaining ones. We discuss the implementation of thread-based competitive or-parallelism in the context of Logtalk, an object-oriented logic programming language, and present experimental results.
Wireless Routing Protocol Based on Auto -- Learning Algorithm
Authors: Ben Arbia Anis, Azza Nguira, Youssef Habib
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

Given the highly dynamic nature of wireless ad hoc network, routing is one of the most challenging tasks. Among the routing protocols that are in the process of normalisation is AODV (Ad hoc on demand Distance Vector). AODV is a reactive source based on routing protocol whose performance is very sensitive to several fixed parameters, such as. ACTIVE_ROUTE_TIMEOUT, HELLO_INTERVAL, MY_ROUTE_TIMEOUT, NET_DIAMETER, RREQ_RETRIES, .... In this paper we propose an adaptive version of AODV (A^2ODV) where the protocol regularly adapts its routing decision to the state of the behaviour and the state of the network. In A^2ODV each node maintains an estimation of the reliability as well as an expected residual uptime of its interfaces. A route is characterized by two metrics: (1) reliability defined as the product of its constituent links; and (2) Route residual lifetime estimated by the residual lifetime of its weakest link. Route selection is a function of these two metrics. Simulation shows that A^2ODV clearly outperforms AODV with respect to packet delivery ratio and overhead traffic.
Lie group integrators for animation and control of vehicles
Authors: Marin Kobilarov, Keenan Crane, Mathieu Desbrun
Venue: ACM Transactions on Graphics (TOG) (2009)

This article is concerned with the animation and control of vehicles with complex dynamics such as helicopters, boats, and cars. Motivated by recent developments in discrete geometric mechanics, we develop a general framework for integrating the dynamics of holonomic and nonholonomic vehicles by preserving their state-space geometry and motion invariants. We demonstrate that the resulting integration schemes are superior to standard methods in numerical robustness and efficiency, and can be applied to many types of vehicles. In addition, we show how to use this framework in an optimal control setting to automatically compute accurate and realistic motions for arbitrary user-specified constraints.
Convergence rates of Markov chains for some self-assembly and non-saturated Ising models
Authors: Sam Greenberg, Dana Randall
Venue: Theoretical Computer Science (2009)

Algorithms based on Markov chains are ubiquitous across scientific disciplines as they provide a method for extracting statistical information about large, complicated systems. For some self-assembly models, Markov chains can be used to predict both equilibrium and non-equilibrium dynamics. In fact, the efficiency of these self-assembly algorithms can be related to the rate at which simple chains converge to their stationary distribution. We give an overview of the theory of Markov chains and show how many natural chains, including some relevant in the context of self-assembly, undergo a phase transition as a parameter representing temperature is varied in the model. We illustrate this behavior for the non-saturated Ising model in which there are two types of tiles that prefer to be next to other tiles of the same type. Unlike the standard Ising model, we also allow empty spaces that are not occupied by either type of tile. We prove that for a local Markov chain that allows tiles to attach and detach from the lattice, the rate of convergence is fast at high temperature and slow at low temperature.