Copyright and computer generated materials : is it time to reboot the discussion about authorship?

Computer generated materials are ubiquitous and we encounter them on a daily basis, even though most people are unaware that this is the case. Blockbuster movies, television weather reports and telephone directories all include material that is produced by utilising computer technologies. Copyright protection for materials generated by a programmed computer was considered by the Federal Court and Full Court of the Federal Court in Telstra Corporation Limited v Phone Directories Company Pty Ltd. The court held that the White and Yellow pages telephone directories produced by Telstra and its subsidiary, Sensis, were not protected by copyright because they were computer-generated works which lacked the requisite human authorship. The Copyright Act 1968 (Cth) does not contain specific provisions on the subsistence of copyright in computer-generated materials. Although the issue of copyright protection for computer-generated materials has been examined in Australia on two separate occasions by independently-constituted Copyright Law Review Committees over a period of 10 years (1988 to 1998), the Committees’ recommendations for legislative clarification by the enactment of specific amendments to the Copyright Act have not yet been implemented and the legal position remains unclear. In the light of the decision of the Full Federal Court in Telstra v Phone Directories it is timely to consider whether specific provisions should be enacted to clarify the position of computer-generated works under copyright law and, in particular, whether the requirement of human authorship for original works protected under Part III of the Copyright Act should now be reconceptualised to align with the realities of how copyright materials are created in the digital era.

Identity-based signcryption

The notion of identity-based IB cryptography was proposed by Shamir [177] as a specialization of public key PK cryptography which dispensed with the need for cumbersome directories, certificates, and revocation lists.

Dessy : desktop search and synchronization

Current smartphones have a storage capacity of several gigabytes. More and more information is stored on mobile devices. To meet the challenge of information organization, we turn to desktop search. Users often possess multiple devices, and synchronize (subsets of) information between them. This makes file synchronization more important. This thesis presents Dessy, a desktop search and synchronization framework for mobile devices. Dessy uses desktop search techniques, such as indexing, query and index term stemming, and search relevance ranking. Dessy finds files by their content, metadata, and context information. For example, PDF files may be found by their author, subject, title, or text. EXIF data of JPEG files may be used in finding them. User–defined tags can be added to files to organize and retrieve them later. Retrieved files are ranked according to their relevance to the search query. The Dessy prototype uses the BM25 ranking function, used widely in information retrieval. Dessy provides an interface for locating files for both users and applications. Dessy is closely integrated with the Syxaw file synchronizer, which provides efficient file and metadata synchronization, optimizing network usage. Dessy supports synchronization of search results, individual files, and directory trees. It allows finding and synchronizing files that reside on remote computers, or the Internet. Dessy is designed to solve the problem of efficient mobile desktop search and synchronization, also supporting remote and Internet search. Remote searches may be carried out offline using a downloaded index, or while connected to the remote machine on a weak network. To secure user data, transmissions between the Dessy client and server are encrypted using symmetric encryption. Symmetric encryption keys are exchanged with RSA key exchange. Dessy emphasizes extensibility. Also the cryptography can be extended. Users may tag their files with context tags and control custom file metadata. Adding new indexed file types, metadata fields, ranking methods, and index types is easy. Finding files is done with virtual directories, which are views into the user’s files, browseable by regular file managers. On mobile devices, the Dessy GUI provides easy access to the search and synchronization system. This thesis includes results of Dessy synchronization and search experiments, including power usage measurements. Finally, Dessy has been designed with mobility and device constraints in mind. It requires only MIDP 2.0 Mobile Java with FileConnection support, and Java 1.5 on desktop machines.

The Impact of Readily Detected- and Underlying Attributes on Social Integration in Cross-Cultural Settings

The benefits and drawbacks of homogeneity and heterogeneity have been debated at length. Whereas some researchers assert that heterogeneity is beneficial for groups that are engaged in complex problem solving, the other researchers emphasize the potential costs associated with diversity. The inconsistency is a result of the incomplete measurement of diversity and focus one or two types of diversity. Most research concentrates on the readily detected/visible characteristics, making the assumption that such characteristics are related to underlying attributes (e.g., attitudes and values). In many cases, the demographic characteristics do not covary perfectly with the psychological attributes. Thus both types of attributes need to be utilized to fully understand the impact of diversity. The present research with four essays takes into account both types of attributes and tests their impact on social integration in cross-cultural settings. The results indicate that: (1) readily detectable- and underlying attributes are not related; (2) diversity has overall a negative impact on social integration; (3) socio-cultural context potentially influences the salience of diversity; and (4) diversity and social integration influences the formation of social cognition in form of transactive memory directories. The limits of research and managerial implications are discussed.

Hierarchical Directory-Based Shared Memory Architecture

We describe the design of a directory-based shared memory architecture on a hierarchical network of hypercubes. The distributed directory scheme comprises two separate hierarchical networks for handling cache requests and transfers. Further, the scheme assumes a single address space and each processing element views the entire network as contiguous memory space. The size of individual directories stored at each node of the network remains constant throughout the network. Although the size of the directory increases with the network size, the architecture is scalable. The results of the analytical studies demonstrate superior performance characteristics of our scheme compared with those of other schemes.

mRegistry: a registry representation for fault diagnosis

Microsoft Windows uses the notion of registry to store all configuration information. The registry entries have associations and dependencies. For example, the paths to executables may be relative to some home directories. The registry being designed with faster access as one of the objectives does not explicitly capture these relations. In this paper, we explore a representation that captures the dependencies more explicitly using shared and unifying variables. This representation, called mRegistry exploits the tree-structured hierarchical nature of the registry, is concept-based and obtained in multiple stages. mRegistry captures intra-block, inter-block and ancestor-children dependencies (all leaf entries of a parent key in a registry put together as an entity constitute a block thereby making the block as the only child of the parent). In addition, it learns the generalized concepts of dependencies in the form of rules. We show that mRegistry has several applications: fault diagnosis, prediction, comparison, compression etc.

O Conselho de Segurança Alimentar e Nutricional do estado do Ceará: um estudo de caso

A Segurança Alimentar e Nutricional (SAN) é um direito humano legalmente reconhecido no Brasil por meio da Lei Orgânica de Segurança limentar e Nutricional. Esta aprovada em 2006 reconhece a atribuição dos conselhos de segurança alimentar e nutricional, por propor diretrizes de políticas públicas de responsabilidade do Estado e da sociedade para garantir esse direito a todos os cidadãos. Este estudo caracteriza o Conselho de Segurança Alimentar e Nutricional do Estado do Ceará (CONSEA/CE) no período de 2003 a 2007, correspondente as duas gestões a partir da sua criação. Tal caracterização pressupõe esse Conselho como um espaço estratégico para o planejamento integrado de políticas no campo da segurança alimentar e nutricional. O principal objetivo foi apreender o papel do CONSEA/CE na construção da política estadual de segurança alimentar e nutricional e sua consolidação como instância de pactuação e de concertação de enfoques e interesses diversos, representados pelo poder público e pela sociedade civil. Para tanto se desenvolveu um estudo de caso com abordagem qualitativa essencialmente descritiva. O grupo de informantes foi composto por dezessete conselheiros, cinco representantes do poder público e doze da sociedade civil, com os quais foram feitas entrevistas semi-estruturadas. Além das entrevistas foi realizada pesquisa documental tendo como fontes as atas das reuniões, a legislação pertinente, federal e estadual e os relatórios das conferências nacionais e estaduais de segurança alimentar e nutricional. Além disso, foi feita observação direta que teve como principal objetivo a apropriação da dinâmica de funcionamento do CONSEA/CE. Conforme os resultados da investigação, esse Conselho representa uma nova dimensão na participação dos sujeitos sociais, por meio da prática de tentar coordenar as ações de diferentes setores da administração pública e destes com a sociedade civil. No entanto, identifica-se como o maior desafio do CONSEA/CE a fragilidade representada pela baixa institucionalidade da política de segurança alimentar e nutricional no Estado.

Multitask learning without label correspondences

We propose an algorithm to perform multitask learning where each task has potentially distinct label sets and label correspondences are not readily available. This is in contrast with existing methods which either assume that the label sets shared by different tasks are the same or that there exists a label mapping oracle. Our method directly maximizes the mutual information among the labels, and we show that the resulting objective function can be efficiently optimized using existing algorithms. Our proposed approach has a direct application for data integration with different label spaces, such as integrating Yahoo! and DMOZ web directories.

South Carolina tobacco directory

This tobacco directory lists tobacco products sold in South Carolina by name, company name, original certification date, action type and agreement type.

Pee Dee food & farm guide

This is an annual guide to local food producers, farmers markets and local food businesses in the Pee Dee Region.

Let's go to work

This document communicates the mission of the Vocational Rehabilitation Department to create relationships among individuals, community partners, agencies, non-profits and businesses. It discusses client services, business services, disability determination services and partnerships. A directory of statewide offices is also provided.

PREGNANCY-RELATED CHURN AND ACCESS TO CARE IN THE CONTEXT OF NARROW NETWORKS IN WASHINGTON STATE

Thesis (Master's)--University of Washington, 2016-03

Direito a ser esquecido na internet

With the recent technological development, we have been witnessing a progressive loss of control over our personal information. Whether it is the speed in which it spreads over the internet or the permanent storage of information on cloud services, the means by which our personal information escapes our control are vast. Inevitably, this situation allowed serious violations of personal rights. The necessity to reform the European policy for protection of personal information is emerging, in order to adapt to the technological era we live in. Granting individuals the ability to delete their personal information, mainly the information which is available on the Internet, is the best solution for those whose rights have been violated. However, once supposedly deleted from the website the information is still shown in search engines. In this context, “the right to be forgotten in the internet” is invoked. Its implementation will result in the possibility for any person to delete and stop its personal information from being spread through the internet in any way, especially through search engines directories. This way we will have a more comprehensive control over our personal information in two ways: firstly, by allowing individuals to completely delete their information from any website and cloud service and secondly by limiting access of search engines to the information. This way, it could be said that a new and catchier term has been found for an “old” right.

Dominion of Canada and Colony of Newfoundland Gazetteer and Classified Business Directory (1899)

Business directory for Canada and Newfoundland for the year 1899

A Hierarchical Cache Coherent Protocol

As the number of processors in distributed-memory multiprocessors grows, efficiently supporting a shared-memory programming model becomes difficult. We have designed the Protocol for Hierarchical Directories (PHD) to allow shared-memory support for systems containing massive numbers of processors. PHD eliminates bandwidth problems by using a scalable network, decreases hot-spots by not relying on a single point to distribute blocks, and uses a scalable amount of space for its directories. PHD provides a shared-memory model by synthesizing a global shared memory from the local memories of processors. PHD supports sequentially consistent read, write, and test- and-set operations. This thesis also introduces a method of describing locality for hierarchical protocols and employs this method in the derivation of an abstract model of the protocol behavior. An embedded model, based on the work of Johnson[ISCA19], describes the protocol behavior when mapped to a k-ary n-cube. The thesis uses these two models to study the average height in the hierarchy that operations reach, the longest path messages travel, the number of messages that operations generate, the inter-transaction issue time, and the protocol overhead for different locality parameters, degrees of multithreading, and machine sizes. We determine that multithreading is only useful for approximately two to four threads; any additional interleaving does not decrease the overall latency. For small machines and high locality applications, this limitation is due mainly to the length of the running threads. For large machines with medium to low locality, this limitation is due mainly to the protocol overhead being too large. Our study using the embedded model shows that in situations where the run length between references to shared memory is at least an order of magnitude longer than the time to process a single state transition in the protocol, applications exhibit good performance. If separate controllers for processing protocol requests are included, the protocol scales to 32k processor machines as long as the application exhibits hierarchical locality: at least 22% of the global references must be able to be satisfied locally; at most 35% of the global references are allowed to reach the top level of the hierarchy.