ppxscal/embedding_network huggingface dataset:
Computerized Simulation in the Social Sciences
Authors: G. David Garson
Venue: Simulation and Gaming (2009)

After years at the periphery of the social sciences, simulation is now emerging as an important and widely used tool for understanding social phenomena. Through simulation, researchers can identify causal effects, specify critical parameter estimates, and clarify the state of the art with respect to what is understood about how processes evolve over time. Moreover, simulation methods are often the most time-effective and cost-effective means of doing so and sometimes are the only means. This essay outlines current developments in the four main branches of social science simulation: systems dynamics models, network models (including neural network models), spatial models, and agent-based models. The limitations of simulation modeling are also discussed, along with methods for evaluating the validity of social science computer simulations.
Designing and optimizing compute kernels on NVIDIA GPUs
Authors: Damir A. Jamsek
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

The availability of high performance compute capability in NVIDIA GPUs has expanded their use in CAD environments. We will describe the basic compute models including host/device programming models, device multi-thread programming models, as well optimization and performance tuning techniques.
Computer programming with middle school students
Authors: Scott Bell, Linda Heeler, Phil Heeler
Venue: Journal of Computing Sciences in Colleges (2009)

Middle school students typically learn how to use the computer through various activities such as word processing, multimedia development, and internet access. This paper describes how computer programming was introduced into the fifth and sixth grades using robots and the Alice programming environment.
Featherweight Java with dynamic and static overloading
Authors: Lorenzo Bettini, Sara Capecchi, Betti Venneri
Venue: Science of Computer Programming (2009)

We propose FMJ (Featherweight Multi Java), an extension of Featherweight Java with encapsulated multi-methods thus providing dynamic overloading. Multi-methods (collections of overloaded methods associated to the same message, whose selection takes place dynamically instead of statically as in standard overloading) are a useful and flexible mechanism which enhances re-usability and separation of responsibilities. However, many mainstream languages, such as, e.g., Java, do not provide it, resorting to only static overloading. The proposed extension is conservative and type safe: both ''message-not-understood'' and ''message-ambiguous'' are statically ruled out. Possible ambiguities are checked during type checking only on method invocation expressions, without requiring to inspect all the classes of a program. A static annotation with type information guarantees that in a well-typed program no ambiguity can arise at run-time. This annotation mechanism also permits modeling static overloading in a smooth way. Our core language can be used as the formal basis for an actual implementation of dynamic (and static) overloading in Java-like languages.
A Particle Swarm Optimization Based Algorithm for Fuzzy Bilevel Decision Making with Objective-Shared Followers
Authors: Ya Gao, Guangquan Zhang, Jie Lu
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

A bilevel decision problem may have multiple followers as the lower decision units and have fuzzy demands simultaneously. This paper focuses on problems of fuzzy linear bilevel decision making with multiple followers who share a common objective but have different constraints (FBOSF). Based on the ranking relationship among fuzzy sets defined by cut set and satisfactory degree, a FBOSF model is presented and a particle swarm optimization based algorithm is developed.
Autodesk Inventor Series 2009 - Inside & Out
Authors: Ron Myers et al, Jon Murdock, Bill Ciesliga
Venue:  (2008)

Autodesk Inventor Series 2009 - Inside and Out offers a comprehensive "Assembly Centric" approach to designing in Autodesk Inventor 2009. The objective of this manual is to provide the reader with an in depth knowledge of Autodesk Inventor. If you are new to Inventor or just need a good desktop reference, this is your book. A very informative index will guide you to the topic or feature you are looking for. Spanning 12 chapters covering, Part and Assembly modeling, Sheet Metal, 2D and 3D Adaptive Assemblies, Flexible Subassemblies, Positional Representations, 2D drawing creation, and importing AutoCAD and Mechanical Desktop drawings, this book will provide you with the information required for success with Inventor.
A Needs-Driven Technology Roadmap for RFID Land of Opportunities in Australia
Authors: Venkatesh Mahadevan, Suresh Radhakrishnan
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Development, implementation and evaluation of integrated logistics chain’s visibility, traceability and usability based on use of the RFID (Radio Frequency Identification) standards has already begun globally. However it is proceeding at a very slow rate in Australia. A key reason for this is the lack of a needsdriven technology roadmap for RFID land of opportunities derived from the shared experiences of the Australian logistics industry. This paper proposes such a needs-driven technology roadmap toprototype a business value-added framework for the Australian logistics industry to build RFID applications. Initially we investigate the key elements of the needs-driven technology roadmap. Next, we illustrate what the Australian logistics industry needs to do pro-actively to fully benefit from the proposed technology roadmap, given their particular logistics activities. Finally, we make some suggestions for the collective vision of the RFID land of opportunities available in the Australian logistics industry.
Self-efficacy, overconfidence, and the negative effect on subsequent performance: A field study
Authors: Trevor T. Moores, Jerry Cha-Jan Chang
Venue: Information and Management (2009)

Self-efficacy has been used to predict the level of performance or usage of IT. The psychological literature has suggested, however, that rather than promoting behavior, it can lead to overconfidence and reduce performance over time. We investigated this claim by studying the relationship between self-efficacy and performance in a field study. Overconfidence was measured metacognitively as the difference between a person's expected performance and his or her actual performance. Using PLS and a sample of 108 students in an systems analysis and design course, we found that for the sample as a whole, self-efficacy was positively and significantly related to performance, and that performance was positively and significantly related to subsequent self-efficacy. When levels of over- and under-confidence were taken into account, however, the relationships changed. In particular, overconfidence leads to a significant negative relationship between self-efficacy and subsequent performance. Implications for user training included the need to use performance feedback in order to allow for a recalibration of self-efficacy towards a more accurate self-assessment of ability.
A scenario-based verification technique to assess the compatibility of collaborative business processes
Authors: Manu De Backer, Monique Snoeck, Geert Monsieur, Wilfried Lemahieu, Guido Dedene
Venue: Data Knowledge Engineering (2009)

Successful E-Business is based on seamless collaborative business processes. Each partner in the collaboration specifies its own rules and interaction preconditions. The verification of the compatibility of collaborative business processes, based on local and global views, is a complex task, which is critical for the success of the cooperation. The verification of process compatibility should be a key element in the design of new business alliances, which makes this verification essential in inter-organizational business process design. The advent of Web Services and Service Oriented Architectures stresses the need to solve complex business cooperations under the pressure of reduced costs and risks, combined with shorter time to market. At the same time, the message-based paradigm results in large and complex processes which makes the verification process quite hard. First the use of an atomic business activity based interaction paradigm is proposed to reduce the complexity of collaborative process models. Next, formal compatibility criteria for business processes are developed. The key construction is the notion of semantic compatibility, which can be used to assess the compatibility of the publicly exposed behavior (a.k.a. business interfaces) between business partners in joint business processes. The formal nature of this compatibility allows to give a precise indication of the degree of compatibility between cooperating business partners. It enables exhaustive lists of incompatible (i.e. unsupported scenarios) business cooperations, which is more comprehensive and complete than the typical compatible or incompatible answer to this question. Finally, complex multiple party interactions can be examined in terms of the safety of the interaction protocols.
Algorithms for Location Estimation Based on RSSI Sampling
Authors: Charalampos Papamanthou, Franco P. Preparata, Roberto Tamassia
Venue: Algorithmic Aspects of Wireless Sensor Networks: Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers (2008)

In this paper, we re-examine the RSSI measurement model for location estimation and provide the first detailed formulation of the probability distribution of the position of a sensor node. We also show how to use this probabilistic model to efficiently compute a good estimation of the position of the sensor node by sampling multiple readings from the beacons (where we do not merely use the mean of the samples) and then minimizing a function with an acceptable computational effort. The results of the simulation of our method in TOSSIM indicate that the location of the sensor node can be computed in a small amount of time and that the quality of the solution is competitive with previous approaches.
Efficient Adaptive Media Scaling and Streaming of Layered Multimedia in Heterogeneous Environment
Authors: Wei Zhao, Marc Willebeek-LeMair, Prasoon Tiwari
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The fast increasing network connectivities to a wider range of end-users and cheaper and diverse end-user devices further exacerbate the need for adaptive and scalable streaming solutions. Motivated by these streaming requirements, we introduce the notion of a layered multimedia presentation and outline a framework for the media scaling and streaming of such presentations across heterogeneous networks to different end-user devices. Layered multimedia is designed to handle heterogeneous and fluctuating resource conditions by trading-off the presentation quality. Based on the results of streaming buffer effects, an efficient on-demand media scaling technique is devised to deliver the highest quality presentation to the end-users, according to their specific network bandwidth and device constraints. Once a presentation is selected, an associated on-the- y transmission scheduling and streaming technique is used for the streaming of multimedia with high efficiency. Efficient media scaling and streaming reduce startup and quality switch delays and facilitates scalable media server design under heavy loads.
Stock market prediction of S&P 500 via combination of improved BCO approach and BP neural network
Authors: Zhang Yudong, Wu Lenan
Venue: Expert Systems with Applications: An International Journal (2009)

The paper proposed an improved bacterial chemotaxis optimization (IBCO), which is then integrated into the back propagation (BP) artificial neural network to develop an efficient forecasting model for prediction of various stock indices. Experiments show its better performance than other methods in learning ability and generalization.
Computational error handling as aspects: a case study
Authors: Zhanqi Cui, Linzhang Wang, Huigen Liu, Xuandong Li
Venue: Proceedings of the 1st workshop on Linking aspect technology and evolution (2009)

Computational error handling is vitally important in scientific computing programs. Traditional approaches tangle the error handling concerns with the primary functional codes. This paper describes our empirical study of using AspectJ to refactor a real-world Satellite Orbit Forecasting (SOF) system, and assesses the experiences gained from applying aspect-oriented techniques. The result shows that the AspectJ version improves the modularity and maintainability of the program by encapsulating computational error handling polices as aspects without noticeable compromise in performance.
An anti-collision algorithm without idle cycle using 4-ary tree in RFID system
Authors: YongHwan Kim, SungSoo Kim, SeongJoon Lee, KwangSeon Ahn
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

This paper proposes an anti-collision algorithm needed in the process of recognizing data of the tags when one reader and multiple passive tags simultaneously have data communications in RFID system. QTA And 4-ary QTA which are based on the Tree algorithm, have the problem that the numbers of query - response are many and the idle cycle (requesting about non-existent tag) exists in the process of recognizing the tags. Advanced 4-ary Query Tree Algorithm(A4QTA) has a 4-ary tree structure and when tag responses according to query of the reader, it applies a digital coding method, the Manchester code, in order to detect the collision point. Also, this algorithm reduces the number of query-response compared to QTA and 4-ary QTA by devising a method for one bit collision and series two bit?s collision in these bits as well as improves the performance by removing the idle cycle.
Individual Traits of Speaking Style and Speech Rhythm in a Spoken Discourse
Authors: Nick Campbell
Venue: Verbal and Nonverbal Features of Human-Human and Human-Machine Interaction: COST Action 2102 International Conference, Patras, Greece, October 29-31, 2007. Revised Papers (2008)

This paper describes an analysis of the verbal and nonverbal speaking characteristics of six speakers of Japanese when talking over the telephone to partners whose degrees of familiarity change over time. The speech data from 100 30-minute conversations between them was transcribed and the acoustic characteristics of each utterance subjected to an analysis of timing characteristics to determine individuality with respect to duration of utterance, degree of overlap, pauses, and other aspects of speech and discourse rhythm. The speakers showed many common traits, but noticeable differences were found to correlate well with degree of familiarity with the interlocutor. Several different styles of interaction can be automatically distinguished in the conversational speech data from their timing patterns.
MobiSoC: a middleware for mobile social computing applications
Authors: Ankur Gupta, Achir Kalra, Daniel Boston, Cristian Borcea
Venue: Mobile Networks and Applications (2009)

Recently, we started to experience a shift from physical communities to virtual communities, which leads to missed social opportunities in our daily routine. For instance, we are not aware of neighbors with common interests or nearby events. Mobile social computing applications (MSCAs) promise to improve social connectivity in physical communities by leveraging information about people, social relationships, and places. This article presents MobiSoC, a middleware that enables MSCA development and provides a common platform for capturing, managing, and sharing the social state of physical communities. Additionally, it incorporates algorithms that discover previously unknown emergent geo-social patterns to augment this state. To demonstrate MobiSoC's feasibility, we implemented and tested on smart phones two MSCAs for location-based mobile social matching and place-based ad hoc social collaboration. Experimental results showed that MobiSoC can provide good response time for 1,000 users. We also demonstrated that an adaptive localization scheme and carefully chosen cryptographic methods can significantly reduce the resource consumption associated with the location engine and security on smart phones. A user study of the mobile social matching application proved that geo-social patterns can double the quality of social matches and that people are willing to share their location with MobiSoC in order to benefit from MSCAs.
On an Adaptive Semirefinement Multigrid Algorithm for Convection-Diffusion Problems
Authors: Daniela Vasileva
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

A multigrid algorithm with adaptive semirefinement is presented for the solution of convection-diffusion problems. The method is based on the discontinuous Galerkin discretisation, which can conveniently handle grid adaptation. The algorithm is presented here for 2D problems, but it can be generalized for 3D. Rectangular finite elements are used and during the process of adaptation they may be refined in the x, y or in both (x and y) directions.The adaptation criterion is based on the comparison of the discrete solution on the finest grid and its restrictions to the next (in the x and y directions) grids. It refines in the x or/and y direction those cells, where the corresponding difference is too large.The numerical experiments show that the algorithm may be successfully used for resolution of boundary and interior layers. The comparison with a similar adaptive refinement multigrid algorithm shows that significantly less computer resources may be used for layers, almost parallel to the x or y axis.
Ring Signatures: Stronger Definitions, and Constructions without Random Oracles
Authors: Adam Bender, Jonathan Katz, Ruggero Morselli
Venue: Journal of Cryptology (2008)

Ring signatures, first introduced by Rivest, Shamir, and Tauman, enable a user to sign a message so that a ring of possible signers (of which the user is a member) is identified, without revealing exactly which member of that ring actually generated the signature. In contrast to group signatures, ring signatures are completely &#x201c;ad-hoc&#x201d; and do not require any central authority or coordination among the various users (indeed, users do not even need to be aware of each other); furthermore, ring signature schemes grant users fine-grained control over the level of anonymity associated with any particular signature. This paper has two main areas of focus. First, we examine previous definitions of security for ring signature schemes and suggest that most of these prior definitions are too weak, in the sense that they do not take into account certain realistic attacks. We propose new definitions of anonymity and unforgeability which address these threats, and give separation results proving that our new notions are strictly stronger than previous ones. Second, we show the first constructions of ring signature schemes in the standard model. One scheme is based on generic assumptions and satisfies our strongest definitions of security. Two additional schemes are more efficient, but achieve weaker security guarantees and more limited functionality.
Interoperability for Multimedia Systems to Support Decision-Makers in the Environment Sector
Authors: S. Nativi, D. Giuli, E. Bugli Innocenti
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper considers interoperability issue among multimedia information systems dealing with environmental data. In particular, interoperability among GIS (Geographical Information Systems) in distributed environment is tackled. An example of implementing interoperability through data models by adopting an emergent standard is presented. This solution has been conceived and developed in the EMAIL Project: a project funded by the European Community in the Telematics Application Programme -Environment Sector. A successful application of such interoperability architecture for supporting decision makers dealing with hydrological risk management of the Arno river basin is reported.
Multiple Access Interference Reduction Using Received Response Code Sequence for DS-CDMA UWB System
Authors: Keat Beng Toh, Shin'ichi Tachikawa
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper proposes a combination of novel Received Response (RR) sequence at the transmitter and a Matched Filter-RAKE (MF-RAKE) combining scheme receiver system for the Direct Sequence-Code Division Multiple Access Ultra Wideband (DS-CDMA UWB) multipath channel model. This paper also demonstrates the effectiveness of the RR sequence in Multiple Access Interference (MAI) reduction for the DS-CDMA UWB system. It suggests that by using conventional binary code sequence such as the M sequence or the Gold sequence, there is a possibility of generating extra MAI in the UWB system. Therefore, it is quite difficult to collect the energy efficiently although the RAKE reception method is applied at the receiver. The main purpose of the proposed system is to overcome the performance degradation for UWB transmission due to the occurrence of MAI during multiple accessing in the DS-CDMA UWB system. The proposed system improves the system performance by improving the RAKE reception performance using the RR sequence which can reduce the MAI effect significantly. Simulation results verify that significant improvement can be obtained by the proposed system in the UWB multipath channel models.
An Encapsulation Structure and Description Specification for Application Level Software Components
Authors: Jin Guojie, Yin Baolin
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Traditional research of software components mainly aims to components at the level of program and source code, due to which the coupling degree between the components and the runtime environments is hard to lower, thereby limiting the reuse ability of the component. The application level components containing comparatively integral granularity of business function are more suitable for a larger scale of application, while there is still lack of reference model and description specification in this field. The inherent deficiency of program level components is analyzed followed by the observation of the unique requirements of application level components, then a novel reference model is proposed. The main advantage of the model is to propel the integration and reuse of legacy software resources by means of transforming currently existing applications into application level components with the wrappers providing standard interfaces. The generalization and applicability of the model are evaluated by real cases.