Men Secretely Sharing a Smoke Artworks

postwar version of F 38366

Three-dimensional corner reflector of arbitrary apex angle

A method of analysing a 3-dimensional corner reflector antenna of arbitrary apex angle is given. Expressions have been obtained for the far field of the 3-dimensional corner reflector fed by a dipole. The radiation resistance and the directive gain of the antenna have been calculated. The method described is applicable even when the feed dipole is arbitrarily oriented. It is found that the radiation along a prescribed direction can be circularly polarised (right or left) by suitably orienting the feed dipole.

On the propagation of a multi-dimensional shock of arbitrary strength

In this paper the kinematics of a curved shock of arbitrary strength has been discussed using the theory of generalised functions. This is the extension of Moslov’s work where he has considered isentropic flow even across the shock. The condition for a nontrivial jump in the flow variables gives the shock manifold equation (sme). An equation for the rate of change of shock strength along the shock rays (defined as the characteristics of the sme) has been obtained. This exact result is then compared with the approximate result of shock dynamics derived by Whitham. The comparison shows that the approximate equations of shock dynamics deviate considerably from the exact equations derived here. In the last section we have derived the conservation form of our shock dynamic equations. These conservation forms would be very useful in numerical computations as it would allow us to derive difference schemes for which it would not be necessary to fit the shock-shock explicitly.

Information sharing in distance collaboration: A software engineering perspective

Information sharing in distance collaboration: A software engineering perspective, QueenslandFactors in software engineering workgroups such as geographical dispersion and background discipline can be conceptually characterized as "distances", and they are obstructive to team collaboration and information sharing. This thesis focuses on information sharing across multidimensional distances and develops an information sharing distance model, with six core dimensions: geography, time zone, organization, multi-discipline, heterogeneous roles, and varying project tenure. The research suggests that the effectiveness of workgroups may be improved through mindful conducts of information sharing, especially proactive consideration of, and explicit adjustment for, the distances of the recipient when sharing information.

Middleware for Mobile Sensing Applications in Urban Environments

Sensor networks represent an attractive tool to observe the physical world. Networks of tiny sensors can be used to detect a fire in a forest, to monitor the level of pollution in a river, or to check on the structural integrity of a bridge. Application-specific deployments of static-sensor networks have been widely investigated. Commonly, these networks involve a centralized data-collection point and no sharing of data outside the organization that owns it. Although this approach can accommodate many application scenarios, it significantly deviates from the pervasive computing vision of ubiquitous sensing where user applications seamlessly access anytime, anywhere data produced by sensors embedded in the surroundings. With the ubiquity and ever-increasing capabilities of mobile devices, urban environments can help give substance to the ubiquitous sensing vision through Urbanets, spontaneously created urban networks. Urbanets consist of mobile multi-sensor devices, such as smart phones and vehicular systems, public sensor networks deployed by municipalities, and individual sensors incorporated in buildings, roads, or daily artifacts. My thesis is that "multi-sensor mobile devices can be successfully programmed to become the underpinning elements of an open, infrastructure-less, distributed sensing platform that can bring sensor data out of their traditional close-loop networks into everyday urban applications". Urbanets can support a variety of services ranging from emergency and surveillance to tourist guidance and entertainment. For instance, cars can be used to provide traffic information services to alert drivers to upcoming traffic jams, and phones to provide shopping recommender services to inform users of special offers at the mall. Urbanets cannot be programmed using traditional distributed computing models, which assume underlying networks with functionally homogeneous nodes, stable configurations, and known delays. Conversely, Urbanets have functionally heterogeneous nodes, volatile configurations, and unknown delays. Instead, solutions developed for sensor networks and mobile ad hoc networks can be leveraged to provide novel architectures that address Urbanet-specific requirements, while providing useful abstractions that hide the network complexity from the programmer. This dissertation presents two middleware architectures that can support mobile sensing applications in Urbanets. Contory offers a declarative programming model that views Urbanets as a distributed sensor database and exposes an SQL-like interface to developers. Context-aware Migratory Services provides a client-server paradigm, where services are capable of migrating to different nodes in the network in order to maintain a continuous and semantically correct interaction with clients. Compared to previous approaches to supporting mobile sensing urban applications, our architectures are entirely distributed and do not assume constant availability of Internet connectivity. In addition, they allow on-demand collection of sensor data with the accuracy and at the frequency required by every application. These architectures have been implemented in Java and tested on smart phones. They have proved successful in supporting several prototype applications and experimental results obtained in ad hoc networks of phones have demonstrated their feasibility with reasonable performance in terms of latency, memory, and energy consumption.

Three-dimensional corner reflector of arbitrary apex angle

A method of analysing a 3-dimensional corner reflector antenna of arbitrary apex angle is given. Expressions have been obtained for the far field of the 3-dimensional corner reflector fed by a dipole. The radiation resistance and the directive gain of the antenna have been calculated. The method described is applicable even when the feed dipole is arbitrarily oriented. It is found that the radiation along a prescribed direction can be circularly polarised (right or left) by suitably orienting the feed dipole.

Multi-user resource-sharing problem for the Internet

In this thesis we study a series of multi-user resource-sharing problems for the Internet, which involve distribution of a common resource among participants of multi-user systems (servers or networks). We study concurrently accessible resources, which for end-users may be exclusively accessible or non-exclusively. For all kinds we suggest a separate algorithm or a modification of common reputation scheme. Every algorithm or method is studied from different perspectives: optimality of protocols, selfishness of end users, fairness of the protocol for end users. On the one hand the multifaceted analysis allows us to select the most suited protocols among a set of various available ones based on trade-offs of optima criteria. On the other hand, the future Internet predictions dictate new rules for the optimality we should take into account and new properties of the networks that cannot be neglected anymore. In this thesis we have studied new protocols for such resource-sharing problems as the backoff protocol, defense mechanisms against Denial-of-Service, fairness and confidentiality for users in overlay networks. For backoff protocol we present analysis of a general backoff scheme, where an optimization is applied to a general-view backoff function. It leads to an optimality condition for backoff protocols in both slot times and continuous time models. Additionally we present an extension for the backoff scheme in order to achieve fairness for the participants in an unfair environment, such as wireless signal strengths. Finally, for the backoff algorithm we suggest a reputation scheme that deals with misbehaving nodes. For the next problem -- denial-of-service attacks, we suggest two schemes that deal with the malicious behavior for two conditions: forged identities and unspoofed identities. For the first one we suggest a novel most-knocked-first-served algorithm, while for the latter we apply a reputation mechanism in order to restrict resource access for misbehaving nodes. Finally, we study the reputation scheme for the overlays and peer-to-peer networks, where resource is not placed on a common station, but spread across the network. The theoretical analysis suggests what behavior will be selected by the end station under such a reputation mechanism.

Designing for collections : Building histories, sharing the spectacle

The hobby of collecting represents the passionate acquisition and possession of a specific type(s) of object; creating a ‘spectacle’, to be shared with others. The fundamentality of the physical objects in collections against the backdrop of the growing ubiquity of computing provides a unique and compelling avenue for design. Based on interviews with 11 self-identified collectors, this paper discusses the role collectors have in informing HCI design and in turn, the potential HCI has in designing technology to assist collectors in sharing what we term the ‘spectacle’ of collecting. Toward this, we suggest two ideas for future designs, including building personal histories of individual collectable items and developing a simple digital means of connecting proximate collectors with those who stand to benefit from collectors’ unique and item-specific knowledge.

(v, k, λ) Configurations and self-dual codes

The incidence matrix of a (v, k, λ) configuration is used to construct a (2v, v) and a (2v + 2, v + 1) self-dual code. If the incidence matrix is a circulant, the codes obtained are quasi-cyclic and extended quasi-cyclic, respectively. The weight distributions of some codes of this type are obtained.

Vibration of Non-Uniform Thin-Walled Beams of Arbitrary Shape

A generalised theory for the natural vibration of non-uniform thin-walled beams of arbitrary cross-sectional geometry is proposed. The governing equations are obtained as four partial, linear integro-differential equations. The corresponding boundary conditions are also obtained in an integro-differential form. The formulation takes into account the effect of longitudinal inertia and shear flexibility. A method of solution is presented. Some numerical illustrations and an exact solution are included.

Free vibration of rectangular plates of arbitrary thickness

Free vibration of thick rectangular plates is investigated by using the “method of initial functions” proposed by Vlasov. The governing equations are derived from the three-dimensional elastodynamic equations. They are obtained in the form of series and theories of any desired order can be constructed by deleting higher terms in the infinite order differential equations. The numerical results are compared with those of classical, Mindlin, and Lee and Reismann solutions.

Things you don't want to know about yourself: Ambivalence about tracking and sharing personal information for behaviour change

Technologies that facilitate the collection and sharing of personal information can feed people's desire for enhanced self-knowledge and help them to change their behaviour, yet for various reasons people can also be reluctant to use such technologies. This paper explores this tension through an interview study in the context of smoking cessation. Our findings show that smokers and recent ex-smokers were ambivalent about their behaviour change as well as about collecting personal information through technology and sharing it with other users. We close with a summary of three challenges emerging from such ambivalence and directions to address them.

Free vibration of rectangular plates of arbitrary thickness with one or more edges clamped

Frequencies of free vibration of rectangular plates of arbitrary thickness, with different support conditions, are calculated by using the Method of Initial Functions (MIF), proposed by Vlasov. Sixth and fourth order MIF theories are used for the solution. Numerical results are presented for three square plates for three thickness ratios. The support conditions considered are (i) three sides simply supported and one side clamped, (ii) two opposite sides simply supported and the other two sides clamped and (iii) all sides clamped. It is found that the results produced by the MIF method are in fair agreement with those obtained by using other methods. The classical theory gives overestimates of the frequencies and the departures from the MIF results increase for higher modes and larger thickness ratios.

Numerical integration over arbitrary polygonal domains based on Schwarz-Christoffel conformal mapping

This paper presents a new numerical integration technique oil arbitrary polygonal domains. The polygonal domain is mapped conformally to the unit disk using Schwarz-Christoffel mapping and a midpoint quadrature rule defined oil this unit disk is used. This method eliminates the need for a two-level isoparametric mapping Usually required. Moreover, the positivity of the Jacobian is guaranteed. Numerical results presented for a few benchmark problems in the context of polygonal finite elements show that the proposed method yields accurate results.

Three-User Cognitive Channels with Cumulative Message Sharing: An Achievable Rate Region

In this paper, an achievable rate region for the three-user discrete memoryless interference channel with asymmetric transmitter cooperation is derived. The three-user channel facilitates different ways of message sharing between the transmitters. We introduce a manner of noncausal (genie aided) unidirectional message-sharing, which we term cumulative message sharing. We consider receivers with predetermined decoding capabilities, and define a cognitive interference channel. We then derive an achievable rate region for this channel by employing a coding scheme which is a combination of superposition and Gel'fand-Pinsker coding techniques.